Reconstruction of rooted trees from subtrees

Discrete Applied Mathematics

Volumn 69, Issue 1-2, 1996, Pages 19-31

  Ng, Meei Pyng ^a   Wormald, Nicholas C ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012337921     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00074-2     Document Type: Article

References (8)

1. A. V. Aho, Y. Sagiv, T. G. Szymanski and J. D. Ullman, Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions, SIAM J. Comput. 10 (1981) 405-121.
2. M. Constantinescu and D Sankoff, An efficient algorithm for supertrees, J. Classification, in press.
3. S. Kannan, E. Lawler and T. Warnow, Determining the evolutionary tree, Symposium on Discrete Algorithms (1990), 475-484.
4. G. Nelson and P. Ladiges, Standard assumptions for biogeographic analysis, Aust. Syst. Bot. 4 (1991) 41-58.
5. G. Nelson and P. Ladiges, Information content and fractional weight of three-item statements, Syst. Biol. 41 (1992) 490-494.
6. C. A. Rodger, private communication.
7. R. Sedgewick, Algorithms in C, (Addison-Wesley, Reading, MA, 1990).
8. M. Steel, The complexity of reconstructing trees from qualitative characters and subtrees, J. Classification 9 (1992) 91-116.