Closure operations in phylogenetics

DOI10.1016/j.mbs.2006.11.005zbMath1119.92048OpenAlexW1971820137WikidataQ51064910 ScholiaQ51064910MaRDI QIDQ2382399

M. Shel Swenson, Mike A. Steel, Stefan Grünewald

Publication date: 9 October 2007

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mbs.2006.11.005

zbMATH Keywords

Phylogenetic treeCompatibilitySupertree

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90)

Related Items (9)

Best match graphs ⋮ Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees ⋮ The matroid structure of representative triple sets and triple-closure computation ⋮ Building species trees from larger parts of phylogenomic databases ⋮ Fast compatibility testing for rooted phylogenetic trees ⋮ Reconstructing gene trees from Fitch's xenology relation ⋮ Explosions and hot spots in supertree methods ⋮ Best match graphs with binary trees ⋮ Generalized Fitch graphs: edge-labeled graphs that are explained by edge-labeled trees

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of reconstructing trees from qualitative characters and subtrees
• When are two qualitative taxonomic characters compatible?
• A phase transition for a random cluster model on phylogenetic trees.
• Phylogenetic supertrees. Combining information to reveal the tree of life
• Reconstructing minimal rooted trees.
• Extension operations on sets of leaf-labelled trees
• Recovering a phylogenetic tree using pairwise closure operations
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
• A few logs suffice to build (almost) all trees (I)
• Algorithmic Aspects of Tree Amalgamation

This page was built for publication: Closure operations in phylogenetics