Making the shortest-paths approach to sum-of-pairs multiple sequence alignment more space efficient in practice
The MSA program, written and distributed in 1989, is one of the few existing programs that attempts to find optimal alignments of multiple protein or DNA sequences. MSA implements a branch-and-bound technique on a variant of Dijkstra's shortest paths algorithm to prune the basic dynamic programming graph. We have made substantial improvements in the time and space usage of MSA. On some runs, we achieve an order of magnitude reduction in space usage and a significant multiplicative factor speedup in running time. To explain these improvements, we give a much more detailed description of MSA than has been previously available.
KeywordsMultiple Sequence Alignment Priority Queue Pairwise Alignment Outgoing Edge Optimal Alignment
Unable to display preview. Download preview PDF.
- 5.H. Bodlaender, R. G. Downey, M. R. Fellows, and H. T. Wareham. The parameterized complexity of sequence alignment and consensus. In Proc. of the 5th Symp. on Combinatorial Pattern Matching, Lecture Notes Comp. Sci. 807, pages 15–30, 1994.Google Scholar
- 9.D. Feng and R. Doolittle. Progressive sequence alignment as a prerequisite to correct phylogenetic trees. J. Molecular Evol., 25:351–360, 1987.Google Scholar
- 11.J. Kececioglu. Notes on an approach of Carrillo and Lipman to minimum sum of pairs multiple sequence alignment. Unpublished notes, 1989.Google Scholar
- 12.J. Kececioglu. The maximum weight trace problem in multiple sequence alignment. In Proc. of the 4th Symp. on Combinatorial Pattern Matching, Springer-Verlag Lecture Notes in Comp. Sci. 684, pages 106–119, 1993.Google Scholar
- 19.L. Wang and T. Jiang. On the complexity of multiple sequence alignment. J. Computational Biology, 1:337–348, 1994.Google Scholar