SIAM Journal on Discrete Mathematics · 2011 · 11 citations · 29 references
Natural SciencesMathematicsCombinatoricsPhylogeneticsSet TheoryPhylogenetic Tree ReconstructionProof Complexity
We study the three-state perfect phylogeny problem and show that there is a three-state perfect phylogeny for a set of input sequences if and only if there is a perfect phylogeny for every subset of three characters. In establishing these results, we prove fundamental structural features of the perfect phylogeny problem on three-state characters and completely characterize the minimal obstruction sets that must occur in input sequences that do not have a perfect phylogeny. We also give a proof for a stated lower bound involved in the conjectured generalization of our main result to any number of states.
29
Efficient algorithms for inferring evolutionary trees
Dan Gusfield · Networks · 1991 · 424 citations
Life Sciences, Evolutionary Biology, Evolutionary Theory +10
A characterisation of rigid circuit graphs
Peter Buneman · Discrete Mathematics · 1974 · 323 citations