We give an explicit construction to solve a conjecture of Mike Steel and David Penny that any phylogeny involving N taxa can be recovered unambiguously using on the order of log N binary characters and the method of maximum parsimony. Biologically, this means that homoplasy need not be a deterrent to parsimony methods. Some patterns of homoplasy are phylogenetically informative and can exponentially reduce the amount of data needed to resolve a phylogeny. © 2010 Society for Mathematical Biology.
CITATION STYLE
Chai, J., & Housworth, E. A. (2011). On the Number of Binary Characters Needed to Recover a Phylogeny Using Maximum Parsimony. Bulletin of Mathematical Biology, 73(6), 1398–1411. https://doi.org/10.1007/s11538-010-9579-3
Mendeley helps you to discover research relevant for your work.