2010/04/23 by Sudheer Vakati, Vakati, Sudheer, David Fernández-Baca +1
Computer Science · #68R10 #92B10 #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.2 #J.3 #acm:68R10 #acm:92B10 #cs.DM #msc:68R10 #msc:92B10
paper · pdf · doi:10.48550/arxiv.1004.4196
arxiv created 2010/04/23 · arxiv updated 2010/04/26
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.