Graph Triangulations and the Compatibility of Unrooted Phylogenetic Trees
classification
💻 cs.DM
keywords
compatibilitygraphtreesphylogeneticunrootedcallcharacterizationcharacterize
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.