Using iterative methods for global multiple sequence alignment.

Abstract excerpt

Finding a global optimal alignment of more than two sequences that includes matches, mismatches, and gaps and that takes into account the degree of variation in all of the sequences at the same time is especially difficult. The dynamic programming algorithm used for optimal alignment of pairs of sequences can be extended to global alignment of three sequences, but for more than three sequences, only a small...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Computational Biology
• Share to Markov Chains