The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees

Discrete Applied Mathematics

Volumn 98, Issue 3, 2000, Pages 227-235

  Ng, Meei Pyng ^a   Steel, Mike ^b   Wormald, Nicholas C ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

Compatibility; NP complete; Phylogenetic trees; Probability; Reconstruction

Indexed keywords

EID: 0347933135     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00160-2     Document Type: Article

References (6)

1. Aho A.V., Sagiv Y., Szymanski T.G., Ullman J.D. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM J. Comput. 10:1981;405-421.
2. Constantinescu M., Sankoff D. An efficient algorithm for supertrees. J. Classification. 12:1995;110-112.
3. M.R. Garey, D.S. Johnson, Computers and Intractability, Bell Telephone Laboraties, Ltd, New Jersey, 1979.
4. M.R. Henzinger, V. King, T. Warnow, Constructing a tree from homeomorphic subtrees, with applications to computational molecular biology, Proceedings ACM / SIAM Symposium on Discrete Algorithms, 1996, pp. 330-340.
5. Ng M.P., Wormald N.C. Reconstruction of rooted trees from subtrees. Discrete Appl. Math. 69:1996;19-31.
6. Steel M. The complexity of reconstructing trees from qualitative characters and subtrees. J. Classification. 9:1992;91-116.