Quasi-best match graphs
From MaRDI portal
Publication:2691571
DOI10.1016/j.dam.2023.01.015OpenAlexW4318831843MaRDI QIDQ2691571
Annachiara Korchmaros, Peter F. Stadler, David Schaller, Marc Hellmuth
Publication date: 29 March 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.10235
Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) General biology and biomathematics (92B05)
Cites Work
- Unnamed Item
- Unnamed Item
- Extension operations on sets of leaf-labelled trees
- 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 and reconciliation of gene trees with species trees
- 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
- Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes.
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Extended Topology: Structure of Isotonic Functions.
- Generating a random sink-free orientation in quadratic time
This page was built for publication: Quasi-best match graphs
