Graph Triangulations and the Compatibility of Unrooted Phylogenetic Trees
Discrete Mathematics
2010-04-26 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1004.4196,
title = {Graph Triangulations and the Compatibility of Unrooted Phylogenetic Trees},
author = {Sudheer Vakati and David Fernández-Baca},
journal= {arXiv preprint arXiv:1004.4196},
year = {2010}
}