Cargando…
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
BACKGROUND: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biological sequences analysis. The SCS problem is well-known to be NP-complete. Many heuristic algorithms have been proposed....
| Autores principales: | , |
|---|---|
| Formato: | Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2006
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1780115/ https://www.ncbi.nlm.nih.gov/pubmed/17217504 http://dx.doi.org/10.1186/1471-2105-7-S4-S12 |