Loading...
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...
Na minha lista:
| Hovedforfatter: | |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Oxford University Press
2008
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC2668612/ https://ncbi.nlm.nih.gov/pubmed/18558620 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1093/bioinformatics/btn308 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|