Cargando…
A Multilevel Probabilistic Beam Search Algorithm for the Shortest Common Supersequence Problem
The shortest common supersequence problem is a classical problem with many applications in different fields such as planning, Artificial Intelligence and especially in Bioinformatics. Due to its NP-hardness, we can not expect to efficiently solve this problem using conventional exact techniques. Thi...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2012
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3531471/ https://www.ncbi.nlm.nih.gov/pubmed/23300667 http://dx.doi.org/10.1371/journal.pone.0052427 |