Tree reconstruction via a closure operation on partial splits

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2066, Issue , 2001, Pages 126-134

  Semple, Charles ^a   Steel, Mike ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; BIOLOGY; INFORMATION SCIENCE;

CLOSURE OPERATIONS; PHYLOGENETIC TREES; SUBTREES; TREE RECONSTRUCTION;

TREES (MATHEMATICS);

EID: 79957605221     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45727-5_11     Document Type: Conference Paper

References (6)

1. Bocker, S., Bryant, D., Dress, A. W. M., and Steel, M. A.: Algorithmic aspects of tree amalgamation. To appear in Journal of Algorithms.
2. Bocker, S., Dress, A. W. M., and Steel, M.: Patching up X-trees. Annals of Combinatorics 3 (1999) 1-12.
3. Bodlaender, H. L., Fellows, M. R., and Warnow, T. J.: Two strikes against perfect phylogeny. In Proceedings of the International Colloquium on Automata, Languages and Programming, Vol. 623 of Lecture Notes in Computer Science, Springer-Verlag, Berlin (1993) 273-283.
4. Buneman, P.: The recovery of trees from measures of dissimilarity. In F. R. Hod- son, D. G. Kendall, and P. Tautu (eds.): Mathematics in the Archaeological and, Historical Sciences, Edinburgh University Press (1971) 387-395.
5. Meacham, C. A.: Theoretical and computational considerations of the compatibility of qualitative taxonomic characters. In J. Felsenstein (ed.): Numerical Taxonomy, NATO ASI Series Vol. G1, Springer-Verlag (1983) 304-314.
6. Steel, M.: The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification 9(1) (1992) 91-116.