Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree

Discrete Applied Mathematics

Volumn 88, Issue 1-3, 1998, Pages 355-366

  Ravi, R ^a   Kececioglu, John D ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b University of Georgia ^*  (United States)

Author keywords

Approximation algorithms; Computational biology; Evolutionary trees; Multiple sequence alignment

Indexed keywords

EID: 0013695811     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00079-1     Document Type: Article

References (21)

1. S.F. Altschul, D. Lipman, Trees, stars, and multiple biological sequence alignment, SIAM J. Appl. Math. 49 (1) (1989) 197-209.
2. V. Bafna, E.L. Lawler, P.A. Pevzner, Approximation algorithms for multiple sequence alignment, Proceedings of the 5th Symposium on Combinatorial Pattern Matching, Springer, Lecture Notes in Computer Science, vol. 807 (1994) pp. 43-53.
3. H. Carrillo, D. Lipman, The multiple sequence alignment problem in biology, SIAM J. Appl. Math. 48 (1988) 1073-1082.
4. W.M. Fitch, Towards defining the course of evolution: minimum change for a specific tree topology, Systematic Zool. 20 (1971) 406-416.
5. S. K. Gupta, J.D. Kececioglu, A.A. Schäffer, Improving the practical space- and time-efficiency of the shortest-paths approach to sum-of-pairs multiple-sequence alignment, J. Comput. Biol. 2 (3) (1995) 459-472.
6. D. Gusfield, Efficient methods for multiple sequence alignment with guaranteed error bounds, Bull. Math. Biol. 55 (1993) 141-154.
7. D. Gusfield, L. Wang, New uses for uniform lifted alignments, Technical Report 96-4, Department of Computer Science, University of California, Davis, January 1996.
8. J.A. Hartigan, Minimum mutation fits to a given tree, Biometrics 29 (1973) 53-65.
9. J. Hein, A new method that simultaneously aligns and reconstructs ancestral sequences for any number of homologous sequences, when the phylogeny is given, Mol. Biol. Evol. 6 (6) (1989) 649-668.
10. J. Hein, Unified approach to alignment and phylogenies, Meth. Enzymol. 188 (1990) 626-645.
11. T. Jiang, E.L. Lawler, L. Wang, Aligning sequences via an evolutionary tree: complexity and approximation, Algorithmics 16 (1996) 302-315.
12. J. Kececioglu, The maximum trace problem in multiple sequence alignment, Proceedings of the 4th Symposium on Combinatorial Pattern Matching, Springer, Lecture Notes in Computer Science, vol. 684, 1993, pp. 106-119.
13. P.A. Pevzner, Multiple alignment, communication cost, and graph matching. SIAM J. Appl. Math. 52 (6) (1992) 1763-1779.
14. R. Ravi, J.D. Kececioglu, Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree, Proceedings of the 5th Symposium on Combinatorial Pattern Matching, Springer, Lecture Notes in Computer Science, vol. 937, 1995, pp. 330-339.
15. K. Reinert, P. Mutzel, H.-P. Lenhof, K. Mehlhorn, J. Kececioglu, A branch- and-cut algorithm for multiple sequence alignment, Proceedings 1st ACM Conf. on Comput. Mol. Biol. (1997) 241-249.
16. D. Sankoff, Minimal mutation trees of sequences, SIAM J. Appl. Math. 28 (1) (1975) 35-42.
17. D. Sankoff, R. Cedergren, Simultaneous comparison of three or more sequences related by a tree, in: D. Sankoff, J. Kruskal (Eds.), Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison, Addison-Wesley, Reading, MA, 1983, pp. 253-264.
18. D. Sankoff, R. Cedergren, G. Laplame, Frequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNA, J. Mol. Evol. 7 (1976) 133-149.
19. L. Wang, D. Gusfield, Improved approximation algorithms for tree alignment, in: Proc. 7th Symp. Combinatorial Pattern Matching (1996) pp. 220-233.
20. L. Wang, T. Jiang, On the complexity of multiple sequence alignment, J. Comp. Biol. 1, 337-348, 1994.
21. M.S. Waterman, M.D. Perlwitz, Line geometries for sequence comparisons, Bull. Math. Biol. 46 (4) (1984) 567-577.