Fixed topology alignment with recombination

Discrete Applied Mathematics

Volumn 104, Issue 1-3, 2000, Pages 281-300

  Wang, Lusheng ^a   Ma, Bin ^b   Li, Ming ^c  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b PEKING UNIVERSITY   (China)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Approximation algorithm; Computational biology; Evolutionary tree; Multiple sequence alignment; Phylogeny; Recombination

Indexed keywords

EID: 0345982677     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00196-7     Document Type: Article

References (21)

1. Altschul S., Lipman D. Trees, stars, and multiple sequence alignment. SIAM J. Appl. Math. 49:1989;197-209.
2. B. DasGupta, X. He, T. Jiang, M. Li, J. Tromp, L. Zhang, On distances between phylogenetic trees, Proceedings of Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, January 1997.
3. DasGupta B., He X., Jiang T., Li M., Tromp J. On the linear-cost subtree-transfer distance. Algorithmica. 25:1999;176-195.
4. Gusfield D. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. 1997;Cambridge University Press, Cambridge.
5. Hein J. 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:1989;649-668.
6. Hein J. Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci. 98:1990;185-200.
7. Hein J. A heuristic method to reconstruct the history of sequences subject to recombination. J. Mol. Evol. 36:1993;396-405.
8. Hein J., Jiang T., Wang L., Zhang K. On the complexity of comparing evolutionary trees. Discrete Appl. Math. 71:1996;153-169.
9. D. Hochbaum, Approximation Algorithms for NP-hard Problems, PWS Publishing Company, Boston, MA, 1997.
10. Kececioglu J., Gusfield D. Reconstructing a history of recombinations from a set of sequences. Discrete Appl. Math. 88:1998;239-260.
11. Sankoff D. Minimal mutation trees of sequences. SIAM J. Appl. Math. 28:1975;35-42.
12. Sankoff D., Cedergren R. Simultaneous comparisons of three or more sequences related by a tree. Sankoff D., Kruskal J. Time Warps, String Edits, and Macromolecules: the Theory and Practice of Sequence Comparison. 1983;Addison-Wesley, Reading, MA.
13. Sankoff D., Cedergren R.J., Lapalme G. Frequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNA. J. Mol. Evol. 7:1976;133-149.
14. Swofford D., Olson G. Phylogenetic reconstruction. Hillis D., Moritz C. Molecular Systemtics. 1990;Sinauer Associates, Sunderland, MA.
15. Wang L., Gusfield D. Improved approximation algorithms for tree alignment. J. Algorithms. 25:1997;173-255.
16. Wang L., Jiang T. On the complexity of multiple sequence alignment. J. Comput. Biol. 1:1994;337-348.
17. L. Wang, T. Jiang, Dan Gusfield, A more efficient approximation scheme for tree alignment, SIAM J. Comput., to appear.
18. Wang L., Jiang T., Lawler E.L. Approximation algorithms for tree alignment with a given phylogeny. Algorithmica. 16:1996;302-315.
19. L. Wang, B. Ma, M. Li, Fixed topology alignment with recombination, TR-99-01, Technical Report, Department of Computer Science, City University of Hong Kong, 1999.
20. Waterman M.S. Introduction to Computational Biology: Maps, Sequences, and Genomes. 1995;Chapman & Hall, London.
21. J.D. Watson, N.H. Hopkins, J.W. Roberts, J.A. Steitz, A.M. Weiner, Molecular Biology of the Gene, 4th Edition, The Benjamin / Cummings Publishing Company, Menlo Park, CA, 1987.