2000 character limit reached
Graph Triangulations and the Compatibility of Unrooted Phylogenetic Trees
Published 23 Apr 2010 in cs.DM | (1004.4196v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.