Extension operations on sets of leaf-labeled trees

Advances in Applied Mathematics

Volumn 16, Issue 4, 1995, Pages 425-453

  Bryant, David ^a   Steel, Mike ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 58149210897     PISSN: 01968858     EISSN: 10902074     Source Type: Journal    
DOI: 10.1006/aama.1995.1020     Document Type: Article

References (20)

1. E. N. Adams, A-trees as nestings: Complexity, similarity and consensus, J. Classification 3 (1986), 299-317.
2. 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, No. 3 (1981), 405-421.
3. A. Amir and D. Keselman, Maximum agreement subtree in a set of evolutionary trees, in "Proceedings 35th IEEE FOCS, Sante Fe, 1994."
4. FL-J. Bandelt and A. W. M. Dress, Reconstructing the shape of a tree from observed dissimilarity data, Adc. in Appl. Math. 7 (1986), 309-343.
5. R. L. Cann, M. Stoneking, and A. C. Wilson, Mitochodrial DNA and human evolution. Nature 325 (1987), 31-36.
6. M. Constantinescu and D. Sankoff, An efficient algorithm for supertrees, J. Classification 12 (1995), 101-112.
7. M. C. H. Dekker, "Reconstruction Methods for Derivation Trees," Masters thesis, University of Amsterdam, 1986.
8. A. W. M. Dress and M. A. Steel, Convex tree realizations of partitions, Appl. Math. Lett. 5, No. 3 (1992), 3-6.
9. N. Eldredge and J. Cracraft, “Phylogenetic Patterns and the Evolutionary Process,” Columbia University Press, New York, 1980.
10. S. K. Kannan and T. J. Warnow, Inferring evolutionary history from DNA sequences, SIAMJ. Comput. 23, No. 4 (1994), 713-737.
11. D. R. Maddison, African origin of human mitochondrial DNA reexamined, Syst. Zooi. 40, No. 3 (1991), 355-393.
12. M. P. Ng and N. C. Wormald, Reconstruction of rooted trees from subtrees, Discrete Appl. Math., in press.
13. M. A. Steel, “Distributions on Bicoloured Evolutionary Trees,” Ph.D. thesis, Massey University, Palmerston North, New Zealand, 1989.
14. M. A. Steel, The complexity of reconstructing trees from qualitative characters and subtrees, J. Classification 9 (1992), 91-116.
15. M. A. Steel, Decompositions of leaf-coloured binary trees, Adv. in Appl. Math. 14 (1993), 1-24.
16. W. Vach, Preserving consensus hierarchies, J. Classification 11 (1994), 59-77.
17. T. J. Warnow, “Combinatorial Algorithms for Constructing Phylogenetic Trees,” Ph.D. thesis, University of California, Berkeley, CA, 1991.
18. T. J. Warnow, Tree compatibility and inferring evolutionary history, J. Algorithms 16 (1994), 388-407.
19. D. J. A. Welsh, “Matroid Theory,” Academic Press, London, 1976.
20. M. Wilkinson, Common cladistic information and its consensus representation: Reduced Adams and reduced cladistic consensus trees and profiles, Syst. Biol. 43, No. 3 (1994), 343-368.