Slim sets of binary trees

Journal of Combinatorial Theory. Series A

Volumn 119, Issue 2, 2012, Pages 323-330

  Grünewald, Stefan ^a,b  

^a MAX PLANCK INSTITUTE   (Germany)

^b MAX PLANCK INSTITUTE FOR MATHEMATICS IN THE SCIENCES   (Germany)

Author keywords

Phylogenetics; Quartets; Supertrees

Indexed keywords

EID: 80053485529     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/j.jcta.2011.09.007     Document Type: Article

References (9)

1. Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life. Comput. Biol. 2004, vol. 4. Kluwer Academic Publishers, Dordrecht, The Netherlands. O.R.P. Binida-Edmonds (Ed.).
2. S. Böcker, From subtrees to supertrees, PhD thesis, Universität Bielefeld, 1999.
3. Böcker S., Bryant D., Dress A., Steel M. Algorithmic aspects of tree amalgamation. J. Algorithms 2000, 37:522-537.
4. Böcker S., Dress A. A note on maximal hierarchies. Adv. Math. 2000, 151:270-282.
5. Böcker S., Dress A. Patchworks. Adv. Math. 2001, 157:1-21.
6. Böcker S., Dress A., Steel M. Patching up X-trees. Ann. Comb. 1999, 3:1-12.
7. Dezulian T., Steel M. Phylogenetic closure operations and homoplasy-free evolution. Classification, Clustering and Data Mining Applications, Proceedings of International Federation of Classification Societies 2004, Springer. D. Banks, L. House, F.R. McMorris, P. Arabie, W. Gaul (Eds.).
8. Semple C., Steel M. Phylogenetics 2003, Oxford University Press.
9. Steel M. The complexity of reconstructing trees from qualitative characters and subtrees. J. Classification 1992, 9:91-116.