A simple characterization of the minimal obstruction sets for three-state perfect phylogenies
From MaRDI portal
Publication:450220
DOI10.1016/j.aml.2012.02.060zbMath1250.92036arXiv1106.0874MaRDI QIDQ450220
David Fernández Baca, Brad Shutters
Publication date: 13 September 2012
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1106.0874
92D15: Problems related to evolution
92-08: Computational methods for problems pertaining to biology
Cites Work
- Unnamed Item
- The three-state perfect phylogeny problem reduces to 2-SAT
- Convex tree realizations of partitions
- The complexity of reconstructing trees from qualitative characters and subtrees
- Generalizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters
- Inferring Evolutionary History From DNA Sequences
- A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
- A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
- Two strikes against perfect phylogeny
- Efficient algorithms for inferring evolutionary trees