A Simple Characterization of the Minimal Obstruction Sets for Three-State Perfect Phylogenies

Details A Simple Characterization of the Minimal Obstruction Sets for Three-State Perfect Phylogenies A Simple Characterization of the Minimal Obstruction Sets for Three-State Perfect Phylogenies

2011-06-05

arxiv.org/abs/1106.0874v1

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Simple Characterization of the Minimal Obstruction Sets for Three-State Perfect Phylogenies does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Simple Characterization of the Minimal Obstruction Sets for Three-State Perfect Phylogenies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Simple Characterization of the Minimal Obstruction Sets for Three-State Perfect Phylogenies will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-307147