Least resolved trees for two-colored best match graphs

DOI10.7155/jgaa.00564zbMath1489.05018arXiv2101.07000OpenAlexW3200161862MaRDI QIDQ5084685

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

Publication date: 28 June 2022

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees

Uses Software

• NetworkX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Corrigendum to: ``Best match graphs
• Oriented bipartite graphs and the Goldbach graph
• Best match graphs with binary trees
• The structure of 2-colored best match graphs
• Best match graphs
• Complete characterization of incorrect orthology assignments in best match graphs
• Complexity of modification problems for best match graphs
• The Graph Menagerie: Abstract Algebra and the Mad Veterinarian
• An On-Line Edge-Deletion Problem
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
• Generating a random sink-free orientation in quadratic time

This page was built for publication: Least resolved trees for two-colored best match graphs