Lataa...

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...

Täydet tiedot

Tallennettuna:
Bibliografiset tiedot
Päätekijät: Löytynoja, Ari, Goldman, Nick
Aineistotyyppi: Artigo
Kieli:Inglês
Julkaistu: National Academy of Sciences 2005
Aiheet:
Linkit: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
Tagit: Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!