On the Number of Binary Characters Needed to Recover a Phylogeny Using Maximum Parsimony

Bulletin of Mathematical Biology

Volumn 73, Issue 6, 2011, Pages 1398-1411

  Chai, Juanjuan ^a   Housworth, Elizabeth Ann ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

Binary characters; Homoplasy; Maximum parsimony; One clustering; Phylogeny

Indexed keywords

DNA;

ALGORITHM; ARTICLE; GENETICS; MOLECULAR EVOLUTION; PHYLOGENY; SEQUENCE ALIGNMENT;

ALGORITHMS; DNA; EVOLUTION, MOLECULAR; PHYLOGENY; SEQUENCE ALIGNMENT;

EID: 79955543260     PISSN: 00928240     EISSN: 15229602     Source Type: Journal    
DOI: 10.1007/s11538-010-9579-3     Document Type: Article

References (6)

1. Bandelt, H.-J. (2001). In A. Brandstädt and V. B. Le (Eds.), Lecture notes in computer science: Vol. 2204. Median hulls as Steiner hulls in rectilinear and molecular sequence space, graph-theoretic concepts in computer science (pp. 1-7). Berlin: Springer.
2. Hendy, M. D., Foulds, L. R., and Penny, D. (1980). Proving phylogenetic trees minimal with l-clustering and set partitioning. Math. Biosci., 51, 71-88.
3. Huber, K. T., Moulton, V., and Steel, M. (2005). Four characters suffice to convexly define a phylogenetic tree. SIAM J. Discrete Math., 18, 835-843.
4. Kälersjö, M., Albert, V. A., and Farris, J. S. (1999). Homoplasy increases phylogenetic structure. Cladistics, 15, 91-93.
5. Lipman, R. J., and Tarjan, R. E. (1979). A separator theorem for planar graphs. SIAM J. Appl. Math., 36, 177-189.
6. Steel, M., and Penny, D. (2005). In V. Albert (Ed.), Maximum parsimony and the phylogenetic information in multi-state characters, parsimony, phylogeny and genomics (pp. 163-178). London: Oxford University Press.