A simple characterization of the minimal obstruction sets for three-state perfect phylogenies

DOI10.1016/j.aml.2012.02.060zbMath1250.92036arXiv1106.0874OpenAlexW2074185282MaRDI QIDQ450220

Brad Shutters, David Fernández Baca

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

zbMATH Keywords

computational biologyphylogeneticsperfect phylogeny

Mathematics Subject Classification ID

Problems related to evolution (92D15) Computational methods for problems pertaining to biology (92-08)

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

This page was built for publication: A simple characterization of the minimal obstruction sets for three-state perfect phylogenies