Recovering a phylogenetic tree using pairwise closure operations

Applied Mathematics Letters

Volumn 18, Issue 3, 2005, Pages 361-366

  Huber, K T ^a,b   Moulton, V ^b   Semple, C ^c   Steel, M ^c  

^a SWEDISH UNIVERSITY OF AGRICULTURAL SCIENCES   (Sweden)

^b UPPSALA UNIVERSITY   (Sweden)

^c UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

Quartets; Semi dyadic closure; Split closure; Splits; Supertree

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

QUARTERS; SEMI-DYNAMIC CLOSURE; SPLIT-CLOSURE; SPLITS; SUPERTREE;

TREES (MATHEMATICS);

EID: 13844281491     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.aml.2004.01.007     Document Type: Article

References (5)

1. S. Böcker, D. Bryant, A. Dress, and M. Steel Algorithmic aspects of tree amalgamation Journal of Algorithms 37 2000 522 537
2. C.A. Meacham Theoretical and computational considerations of the compatibility of qualitative taxonomic characters J. Felsenstein Numerical Taxonomy NATO ASI Series vol. G1 1983 Springer-Verlag 304 314
3. C. Semple, and M. Steel Tree reconstruction via a closure operation on partial splits O. Gascuel M.-F. Sagot Proceedings of Journées Ouvertes: Biologie, Informatique et Mathématiques Lecture Notes in Computer Science vol. 2066 2001 Springer-Verlag Berlin 129 134
4. C. Semple, and M. Steel Phylogenetics 2003 Oxford University Press
5. M. Steel The complexity of reconstructing trees from qualitative characters and subtrees Journal of Classification 9 1992 91 116