• Mathematics, Computer Science
  • Published in SIAM J. Discrete Math. 2009
  • DOI:10.1137/090776305

Generalizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters

@article{Lam2009GeneralizingTS,
  title={Generalizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters},
  author={Fumei Lam and Dan Gusfield and Srinath Sridhar},
  journal={SIAM J. Discrete Math.},
  year={2009},
  volume={25},
  pages={1144-1175}
}
We study the perfect phylogeny problem and establish a generalization of the four gamete condition (also called the Splits Equivalence Theorem) for sequences over three state characters. Our main result is that a set of input sequences over three state characters allows a perfect phylogeny if and only if every subset of three characters allows a perfect phylogeny. In establishing these results, we prove fundamental structural features of the perfect phylogeny problem on three state characters… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 10 CITATIONS

Contributions to computational phylogenetics and algorithmic self-assembly

VIEW 12 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A Third Strike Against Perfect Phylogeny

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Fixed parameter algorithms for compatible and agreement supertree problems

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Improved Lower Bounds on the Compatibility of Multi-State Characters

VIEW 7 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Incompatible quartets, triplets, and characters

VIEW 12 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Defining a Phylogenetic Tree with the Minimum Number of r-State Characters

VIEW 1 EXCERPT
CITES BACKGROUND

Minimum Average Distance Clique Trees

VIEW 1 EXCERPT
CITES METHODS

Unique perfect phylogeny is intractable

VIEW 1 EXCERPT
CITES BACKGROUND

Unique Perfect Phylogeny Is NP-Hard

VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 34 REFERENCES

On the problem of discovering the most parsimonious tree

  • W. M. Fitch
  • American Naturalist, 11:223–257
  • 1977
VIEW 13 EXCERPTS
HIGHLY INFLUENTIAL

Toward finding the tree of maximum parsimony

  • W. M. Fitch
  • The Eighth International Conference on Numerical Taxonomy (Estabrook, G. F., ed.), San Francisco: W. H. Freeman and Company, pages 189?–220
  • 1975
VIEW 14 EXCERPTS
HIGHLY INFLUENTIAL

Efficient algorithms for inferring evolutionary trees

VIEW 2 EXCERPTS

A Linear-Time Algorithm for the Perfect Phylogeny Haplotype Problem

VIEW 2 EXCERPTS

Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice