Ontology highlight
ABSTRACT:
SUBMITTER: Loytynoja A
PROVIDER: S-EPMC1180752 | biostudies-literature | 2005 Jul
REPOSITORIES: biostudies-literature
Proceedings of the National Academy of Sciences of the United States of America 20050706 30
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 because pairwise algorithms do not differentiate insertions from deletions and end up penalizing single insertion events multiple times. Such an unrealistically high penalty for insertions typically r ...[more]