Cargando…
Memory-efficient dynamic programming backtrace and pairwise local sequence alignment
Motivation: A backtrace through a dynamic programming algorithm's intermediate results in search of an optimal path, or to sample paths according to an implied probability distribution, or as the second stage of a forward–backward algorithm, is a task of fundamental importance in computational...
| Autor principal: | |
|---|---|
| Formato: | Texto |
| Lenguaje: | English |
| Publicado: |
Oxford University Press
2008
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2668612/ https://www.ncbi.nlm.nih.gov/pubmed/18558620 http://dx.doi.org/10.1093/bioinformatics/btn308 |