On the complexity of comparing evolutionary trees

Discrete Applied Mathematics

Volumn 71, Issue 1-3, 1996, Pages 153-169

  Hein, Jotun ^c   Jiang, Tao ^a   Wang, Lusheng ^a   Zhang, Kaizhong ^b  

^a MCMASTER UNIVERSITY   (Canada)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

^c NONE

Author keywords

Approximation algorithm; Compatibility; Computational complexity; Evolutionary tree; Phylogeny; Recombination

Indexed keywords

EID: 0002291589     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00062-5     Document Type: Article

References (20)

1. A. Amir and D. Keselman, Maximum agreement subtree in a set of evolutionary trees - metrics and efficient algorithms. Proceedings of the 35th IEEE Symp. Found. Comput. Sci., 1994.
2. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and hardness of approximation problems, Proceedings of the 33rd IEEE Symp. Found. Comput. Sci. (1992) 14-23.
3. G. Estabrook, C. Johnson and F. McMorris, A mathematical foundation for the analysis of cladistic character compatibility, Math. Biosci. 29 (1976) 181-187.
4. M. Farach and M. Thorup, Fast comparison of evolutionary trees, Proceedings of the 5th Ann. ACM-SIAM Symp. Discrete Algorithms, 1994.
5. M. Farach and M. Thorup, Optimal evolutionary tree comparison by sparse dynamic programming, Proceedings of the 35th IEEE Symp. Found. Comput. Sci., 1994.
6. C. Finden and A. Gordon, Obtaining common pruned trees, J. Classification 2 (1985) 255-276.
7. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
8. D. Gusfield, Efficient algorithms for inferring evolutionary trees, Networks 21 (1991) 19-28.
9. A.M. Hamel and M.A. Steel, Finding a maximum compatible tree is NP-hard, Tech. Report No. 114, Department of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand, October 1994.
10. J. Hein, Reconstructing evolution of sequences subject to recombination using parsimony, Math. Biosci. 98, 185-200, 1990
11. J. Hein, A heuristic method to reconstruct the history of sequences subject to recombination, J. Mol. Evo. 36 (1993) 396-405.
12. T. Jiang and M. Li, On the approximation of shortest common supersequences and longest common subsequences, SIAM J. Comput. 24 (1995) 1122-1139.
13. T. Jiang, L. Wang and K. Zhang, Alignment of trees - an alternative to tree edit, Theoret. Comput. Sci. 143-1 (1995) 137-148.
14. V. Kann, Maximum bounded 3-dimensional matching is MAX SNP-complete, Inform. Process. Lett. 37 (1991) 27-35.
15. J. Kececioglu and D. Gusfield, Reconstructing a history of recombinations from a set of sequences, Proceedings of the 5th Ann. ACM-SIAM Symp. Discrete Algorithms, 1994.
16. C.H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci. 43 (1991) 425-440.
17. M. Steel and T. Warnow, Kaikoura tree theorems: computing the maximum agreement subtree, Inform. Process. Lett. 48 (1993) 77-82.
18. T. Warnow, Tree compatibility and inferring evolutionary history, J. Algorithms 16 (1994) 388-407.
19. T. Warnow, Private communication (1994).
20. K. Zhang and D. Shasha, Simple fast algorithms for the editing distance between trees and related problems, SIAM J. Comput. 18 (1989) 1245-1262.