Slim Sets of Binary Trees

Details Slim Sets of Binary Trees Slim Sets of Binary Trees

2010-06-28

arxiv.org/abs/1006.5280v1

Mathematics

Combinatorics

Scientific paper

A classical problem in phylogenetic tree analysis is to decide whether there is a phylogenetic tree $T$ that contains all information of a given collection $\cP$ of phylogenetic trees. If the answer is "yes" we say that $\cP$ is compatible and $T$ displays $\cP$. This decision problem is NP-complete even if all input trees are quartets, that is binary trees with exactly four leaves. In this paper, we prove a sufficient condition for a set of binary phylogenetic trees to be compatible. That result is used to give a short and self-contained proof of the known characterization of quartet sets of minimal cardinality which are displayed by a unique phylogenetic tree.

Affiliated with

Also associated with

No associations

Rating

Slim Sets of Binary Trees 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 Slim Sets of Binary Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Slim Sets of Binary Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-616100