Aligning sequences via an evolutionary complexity and approximation tree

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 760-769

  Jiang, Tao ^a   Lawler, Eugene L ^b   Wang, Lusheng ^a  

^a MCMASTER UNIVERSITY   (Canada)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; BIOINFORMATICS; COSTS; DNA SEQUENCES; EVOLUTIONARY ALGORITHMS; ITERATIVE METHODS; MOLECULAR BIOLOGY; POLYNOMIAL APPROXIMATION; TOPOLOGY; ALGORITHMS; BINARY SEQUENCES; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; POLYNOMIALS;

COMPUTATIONAL BIOLOGY; COMPUTATIONAL MOLECULAR BIOLOGY; EFFICIENT APPROXIMATION ALGORITHMS; EVOLUTIONARY GENETICS; MULTIPLE SEQUENCE ALIGNMENTS; OPTIMAL ALIGNMENTS; PHYLOGENETIC TREES; POLYNOMIAL TIME APPROXIMATION SCHEMES;

TREES (MATHEMATICS);

ALIGNING SEQUENCES; COMPUTATIONAL MOLECULAR BIOLOGY; EVOLUTIONARY TREES; GENERALIZED TREE ALIGNMENT; MULTIPLE SEQUENCE ALIGNMENT; PHYLOGENETIC TREE;

EID: 0027961628     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195454     Document Type: Conference Paper

References (31)

1. S. Altschul and D. Lipman, Trees, stars, and multiple sequence alignment, SIAM Journal on Applied Math. 49, pp. 197-209, 1989.
2. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and hardness of approxima-Tion problems, Proc. IEEE 33rd FOCS, 1992.
3. M. Bern and P. Plassmann, The Steiner problem with edge lengths 1 and 2, Information Processing Letters 32, pp. 171-176, 1989.
4. P. Berman and V. Ramaiyer, Improved approximation for the Steiner tree problem, Manuscript, 1993.
5. S.C. Chan, A.K.C. Wong and D.K.T. Chiu, A survey of multiple sequence comparison methods, Bulletin of Mathematical Biology 54(4), pp. 563-598, 1992.
6. D.Z. Du, Y. Zhang and Q. Feng, On better heuristic for Euclidean Steiner minimum trees, Proc. IEEE 3Snd FOCS, pp. 431-439, 1991.
7. J.S. Farris, Methods for computing Wagner trees, Sys-Tematic Zoology 19, pp. 83-92, 1997.
8. L.R. Foulds and R.L. Graham, The Steiner problem in phylogeny is NP-complete, Advances in Applied Math-ematics 3, pp. 43-49, 1982.
9. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness, W. H. Freeman, 1979.
10. D. Gusfield, Efficient methods for multiple sequence alignment with guaranteed error bounds, Bulletin of Mathematical Biology 55, pp. 141-154, 1993.
11. J.J.Hein, A tree reconstruction method that is econom-ical in the number of pairwise comparisons used, Mol. Biol. Evol. 6(6), pp. 669-684, 1989.
12. J.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), pp. 649-668, 1989.
13. F.K. Hwang and D.S. Richards, Steiner tree problems, Networks 22, pp. 55-89, 1992.
14. F.K. Hwang and J.F. Weng, The shortest network un-der a given topology, Journal of Algorithms 13, pp. 468-488, 1992.
15. T. Jiang and M. Li, Optimization problems in molecu-lar biology, to appear in Advances in Optimization and Approximation, D.Z. Du and J. Sun (eds.), 1993.
16. R.M. Karp, Mapping the genome: some combinatorial problems arising in molecular biology, ACM STOC'93, pp. 278-285, 1993.
17. R.M. Karp, Probabilistic analysis of partitioning algo-rithms for the traveling salesman problem in the plane, Math. Operations Research 2, pp. 209-224, 1977.
18. E.S. Lander, R. Langridge and D.M. Saccocio, Map-ping and interpreting biological information, Commu-nications of the ACM 34(11), pp. 33-39, 1991.
19. C.H. Papadimitriou and M. Yannakakis, Optimiza-Tion, Approximation, and complexity classes, Journal of Computer and System Sciences 43, pp. 425-440, 1991.
20. D. Penny, Criteria for optimising phylogenetic trees and the problem of determining the root of a tree, J. Mol. Evol. 8, pp. 95-116, 1976.
21. P. Pevzner, Multiple alignment, communication cost, and graph matching, SIAM J. Applied Math. 56(6), pp. 1763-1779, 1992.
22. D. Sankoff, Minimal mutation trees of sequences, SIAM J. APPL. Math. 28(1), pp. 35-42, 1975.
23. D. Sankoff and P. Rousseau, Locating the vertices of a Steiner tree in an arbitrary metric space, Mathematical Programming 9, pp. 240-246, 1975.
24. D. Sankoff, R. Cedergren and G. Lapalme, Frequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNA, J. Mol. Evol. 7, pp.133-149, 1976.
25. D. Sankoff and R. Cedergren, Simultaneous compar-isons of three or more sequences related by a tree, in D. Sankoff and J. Kruskal (eds), Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, pp. 253-264, Addison Wesley, Reading Mass., 1983.
26. D. Sankoff and J. Kruskal (Eds), Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, Addison Wesley, Reading Mass., 1983.
27. N. Saitou and M. Nei, The neighbor-joining method: A new method for reconstructing phylogenetic trees, Mol. Biol. Evol. 4, 4, pp. 406-425, 1987.
28. E. Sweedyk and T. Warnow, Manuscript, 1992.
29. M.S. Waterman and M.D. Perlwitz, Line geometries for sequence comparisons. Bull. Math. Biol. 46, pp. 567- 577, 1984.
30. M.S. Waterman, Sequence alignments, in Mathemati-cal Methods for DNA Sequences, M.S. Waterman (ed.), CRC, Boca Raton, FL, pp. 53-92, 1989.
31. A.Z. Zelikovsky, The 11/6 approximation algorithm for the Steiner problem on networks, Algorithmica 9, pp. 463-470, 1993.