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

From MaRDI portal
Publication:450220

DOI10.1016/J.AML.2012.02.060zbMATH Open1250.92036arXiv1106.0874OpenAlexW2074185282MaRDI QIDQ450220FDOQ450220

David Fernández-Baca, Brad Shutters

Publication date: 13 September 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Abstract: Lam, Gusfield, and Sridhar (2009) showed that a set of three-state characters has a perfect phylogeny if and only if every subset of three characters has a perfect phylogeny. They also gave a complete characterization of the sets of three three-state characters that do not have a perfect phylogeny. However, it is not clear from their characterization how to find a subset of three characters that does not have a perfect phylogeny without testing all triples of characters. In this note, we build upon their result by giving a simple characterization of when a set of three-state characters does not have a perfect phylogeny that can be inferred from testing all pairs of characters.


Full work available at URL: https://arxiv.org/abs/1106.0874





Cites Work







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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450220)