Finding a maximum compatible tree is NP-hard for sequences and trees

Applied Mathematics Letters

Volumn 9, Issue 2, 1996, Pages 55-59

  Hamel, A M ^a   Steel, M A ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

Compatibility; NP hard; Sequences; Trees

Indexed keywords

EID: 0038875361     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/0893-9659(96)00012-2     Document Type: Article

References (8)

1. P. Buneman, The recovery of trees from measures of dissimilarity, In Mathematics in the Archaeological and Historical Sciences, (Edited by F.R. Hodson, D.G. Kendall, and P. Tautu), pp. 387-395, Edinburgh University Press, Edinburgh, (1971).
2. D. Gusfield, Efficient algorithms for inferring evolutionary trees, Networks 21, 19-28 (1991).
3. W.H.E. Day and D. Sankoff, Computational complexity of inferring phylogenies by compatibility, Syst. Zool. 35 (2), 224-229 (1986).
4. M. Steel and T. Warnow, Kaikoura tree theorems: Computing the maximum agreement subtree, Inform. Proc. Lett. 48, 77-82 (1993).
5. A. Amir and D. Kesselman, Maximum agreement subtree in a set of evolutionary trees - Metrics and efficient algorithms, (submitted).
6. C.R. Finden and A.D. Gordon, Obtaining common pruned trees, J. Classification 2, 255-176 (1985).
7. A. Dress and M. Steel, Convex tree realizations of partitions, Appl. Math. Lett. 5 (3), 3-6 (1992).
8. R.M. Karp, Reducibility among combinatorial problems, In Complexity of Computer Computations, (Edited by R.E. Miller and J.W. Thatcher), pp. 85-103, Plenum Press, New York, (1972).