Computer Science – Discrete Mathematics
Scientific paper
2010-04-23
Computer Science
Discrete Mathematics
Scientific paper
We characterize the compatibility of a collection of unrooted phylogenetic
trees as a question of determining whether a graph derived from these trees ---
the display graph --- has a specific kind of triangulation, which we call
legal. Our result is a counterpart to the well known triangulation-based
characterization of the compatibility of undirected multi-state characters.
Fernández-Baca David
Vakati Sudheer
No associations
LandOfFree
Graph Triangulations and the Compatibility of Unrooted Phylogenetic 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 Graph Triangulations and the Compatibility of Unrooted Phylogenetic Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph Triangulations and the Compatibility of Unrooted Phylogenetic Trees will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-695102