Four characters suffice to convexly define a phylogenetic tree

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 4, 2005, Pages 835-843

  Huber, Katharina T ^a   Moulton, Vincent ^a   Steel, Mike ^b  

^a UNIVERSITY OF EAST ANGLIA   (United Kingdom)

^b UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

Character compatibility; Convexly define; Display; Phylogenetic tree; Semidyadic closure; X tree

Indexed keywords

FUNCTIONS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SET THEORY;

CHARACTER COMPATIBILITY; CONVEXLY DEFINE; DISPLAY; PHYLOGENETIC TREE; SEMIDYALIC CLOSURE; X-TREE;

TREES (MATHEMATICS);

EID: 27844511917     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480102416696     Document Type: Article

References (12)

1. R. AGARWALA AND D. FERNÁNDEZ-BACA, A polynomial-time algorithm for the phylogeny problem when the number of character states is fixed, SIAM J. Comput., 23 (1994), pp. 1216-1224.
2. H.-J. BANDELT AND A. W. M. DRESS, Reconstructing the shape of a tree from observed dissimilarity data, Adv. Appl. Math., 7 (1986), pp. 309-343.
3. S. BÖCKER, D. BRYANT, A. W. M. DRESS, AND M. A. STEEL, Algorithmic aspects of tree amalgamation, J. Algorithms, 37 (2000), pp. 522-537.
4. P. BUNEMAN, The recovery of trees from measures of dissimilarity, in Mathematics in the Archaeological and Historical Sciences, F. R. Hodson, D. G. Kendall, and P. Tautu, eds., Edinburgh University Press, Edinburgh, 1971, pp. 387-395.
5. H. COLONIUS AND H. H. SCHULZE, Tree structures for proximity data, British J. Math. Statist. Psych., 34 (1981), pp. 167-180.
6. M. C. H. DEKKER, Reconstruction Methods for Derivation Trees, unpublished Masters thesis, Vrije Universiteit, Amsterdam, Netherlands, 1986.
7. S. KANNAN AND T. WARNOW, A fast algorithm for the computation and enumeration of perfect phylogenies, SIAM J. Comput., 26 (1997), pp. 1749-1763.
8. F. R. MCMORRIS, T. J. WARNOW, AND T. WIMER, Triangulating vertex-colored graphs, SIAM J. Discrete Math., 7 (1994), pp. 296-306.
9. C. SEMPLE AND M. STEEL, Tree reconstruction via a closure operation on partial splits, in Proceedings of journées ouvertes: Biologie, informatique et mathématique, Lecture Notes in Comput. Sci. 2066, O. Gascuel and M.-F. Sagot, eds., Springer-Verlag, Berlin, 2001, pp. 126-134.
10. C. SEMPLE AND M. STEEL, Tree reconstruction from multi-state characters, Adv. Appl. Math., 28 (2002), pp. 169-184.
11. C. SEMPLE AND M. STEEL, Phylogenetics, Oxford University Press, Oxford, 2003.
12. M. STEEL, The complexity of reconstructing trees from qualitative characters and subtrees, J. Classification, 9 (1992), pp. 91-116.