Extending the limits of supertree methods

Annals of Combinatorics

Volumn 10, Issue 1, 2006, Pages 31-51

  Bordewich, Magnus ^a   Evans, Gareth ^b   Semple, Charles ^b  

^a DURHAM UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

AncestralBuild; Nested taxa; RankedTree; Supertree methods

Indexed keywords

EID: 33745470940     PISSN: 02180006     EISSN: 02193094     Source Type: Journal    
DOI: 10.1007/s00026-006-0272-z     Document Type: Article

References (10)

1. A.V. Aho, S. Yehoshua, T.G. Szymanski, and J.D. Ullman, Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions, SLAM J. Comput. 10 (1981) 405-121.
2. M. Bordewich and C. Semple, Counting consistent phylogenetic trees is #P-complete, Adv. in Appl. Math. 33 (2004) 416-430.
3. D. Bryant, C. Semple, and M. Steel, Supertree methods for ancestral divergence dates and other applications, In: Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life, O. Bininda-Emonds, Ed., Computational Biology Series, Kluwer, (2004) pp. 129-150.
4. M. Constantinescu and D. Sankoff, An efficient algorithm for supertrees, J. Classification 12 (1995)101-112.
5. P. Daniel, W. Hordijk, R.D.M. Page, C. Semple, and M. Steel, Supertree algorithms for ancestral divergence dates and nested taxa, Bioinformatics 20 (2004) 2355-2360.
6. P. Daniel and C. Semple, Supertree algorithms for nested taxa, In: Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life, O. Bininda-Emonds, Ed., Computational Biology Series, Kluwer, (2004) pp. 151-171.
7. P. Daniel and C. Semple, A class of general supertree methods for nested taxa, SIAM J. Discrete Math., to appear.
8. M.P. Ng and N.C. Wormald, Reconstruction of rooted trees from subtrees, Discrete Appl. Math. 69 (1996) 19-31.
9. C. Semple, Reconstructing minimal rooted trees, Discrete Appl. Math. 127 (2003) 489-503.
10. C. Semple and M. Steel, Phylogenetics, Oxford University Press, 2003.