Carregant...
An algorithm for progressive multiple alignment of sequences with insertions
Dynamic programming algorithms guarantee to find the optimal alignment between two sequences. For more than a few sequences, exact algorithms become computationally impractical, and progressive algorithms iterating pairwise alignments are widely used. These heuristic methods have a serious drawback...
Guardat en:
| Autors principals: | , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
National Academy of Sciences
2005
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.gov/pmc/articles/PMC1180752/ https://ncbi.nlm.nih.gov/pubmed/16000407 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1073/pnas.0409137102 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|