A general method for fast multiple sequence alignment.

Abstract

We have developed a fast heuristic algorithm for multiple sequence alignment which provides near-to-optimal results for sufficiently homologous sequences. The algorithm makes use of the standard dynamic programming procedure by applying it to all pairs of sequences. The resulting score matrices for pair-wise alignment give rise to secondary matrices… (More)

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.