Best match graphs with binary trees

DOI10.1007/978-3-030-74432-8_6zbMath1480.92153arXiv2011.00511OpenAlexW3173515872MaRDI QIDQ2062000

David Schaller, Peter F. Stadler, Marc Hellmuth, Manuela Geiß

Publication date: 21 December 2021

Full work available at URL: https://arxiv.org/abs/2011.00511

zbMATH Keywords

polynomial-time algorithmbinary treesbest match graphsrooted triple consistency

Mathematics Subject Classification ID

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

Related Items (4)

Compatibility of partitions with trees, hierarchies, and split systems ⋮ Least resolved trees for two-colored best match graphs ⋮ Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees ⋮ Quasi-best match graphs

Cites Work

• Unnamed Item
• Fast compatibility testing for rooted phylogenetic trees
• Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
• The matroid structure of representative triple sets and triple-closure computation
• Reconstructing gene trees from Fitch's xenology relation
• Reconstructing minimal rooted trees.
• Extension operations on sets of leaf-labelled trees
• Corrigendum to: ``Best match graphs
• Best match graphs and reconciliation of gene trees with species trees
• Closure operations in phylogenetics
• Best match graphs
• Complete characterization of incorrect orthology assignments in best match graphs
• Complexity of modification problems for best match graphs
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions

This page was built for publication: Best match graphs with binary trees