Automated generation of heuristics for biological sequence comparison
BACKGROUND: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. We introduce bounded sparse dynamic programming (BSDP) to allow rapid approximation to exhaustive alignment. This is used...
Guardat en:
| Publicat a: | BMC Bioinformatics |
|---|---|
| Autors principals: | , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
BMC
2005
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.govhttps://pmc.ncbi.nlm.nih.gov/articles/PMC553969/ https://ncbi.nlm.nih.govhttps://pubmed.ncbi.nlm.nih.gov/15713233/ https://ncbi.nlm.nih.govhttps://doi.org/10.1186/1471-2105-6-31 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|