Papers › Best Match Graphs
Best Match Graphs
Manuela Geiß, Edgar Chavez, Marcos Gonzalez, Alitzel Lopez, Bärbel M. R. Stadler, Dulce I. Valdivia, Marc Hellmuth, Maribel H. Rosales, Peter F. Stadler
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
THIS IS A CORRECTED VERSION INCLUDING AN APPENDED CORRIGENDUM. Best match graphs arise naturally as the first processing intermediate in algorithms for orthology detection. Let T be a phylogenetic (gene) tree T and σ an assignment of leaves of T to species. The best match graph (G,σ) is a digraph that contains an arc from x to y if the genes x and y reside in different species and y is one of possibly many (evolutionary) closest relatives of x compared to all other genes contained in the species σ(y). Here, we characterize best match graphs and show that it can be decided in cubic time and quadratic space whether (G,σ) derived from a tree in this manner. If the answer is affirmative, there is a unique least resolved tree that explains (G,σ), which can also be constructed in cubic time.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections