The following publications are possibly variants of this publication:
- Best Match Graphs with Binary TreesDavid Schaller 0001, Manuela Geiß, Marc Hellmuth, Peter F. Stadler. alcob 2021: 82-93 [doi]
- Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match GraphsDavid Schaller 0001, Manuela Geiß, Marc Hellmuth, Peter F. Stadler. algorithms, 14(4):110, 2021. [doi]
- Least resolved trees for two-colored best match graphsDavid Schaller 0001, Manuela Geiß, Marc Hellmuth, Peter F. Stadler. jgaa, 25(1):397-416, 2021. [doi]
- Quasi-best match graphsAnnachiara Korchmaros, David Schaller 0001, Marc Hellmuth, Peter F. Stadler. DAM, 331:104-125, May 2023. [doi]
- From Best Match Graphs to Gene Trees: A new perspective on graph-based orthology inferenceManuela Geiß. PhD thesis, Leipzig University, Germany, 2019. [doi]
- Complexity of modification problems for reciprocal best match graphsMarc Hellmuth, Manuela Geiß, Peter F. Stadler. TCS, 809:384-393, 2020. [doi]
- Heuristic algorithms for best match graph editingDavid Schaller 0001, Manuela Geiß, Marc Hellmuth, Peter F. Stadler. almob, 16(1):19, 2021. [doi]
- Complexity of modification problems for best match graphsDavid Schaller 0001, Peter F. Stadler, Marc Hellmuth. TCS, 865:63-84, 2021. [doi]