×

Corrigendum to: “Best match graphs”. (English) Zbl 07340472

Summary: Two errors in the article “Best Match Graphs” [M. Geiß et al., J. Math. Biol. 78, No. 7, 2015–2057 (2019; Zbl 1415.92133)] are corrected. One concerns the tacit assumption that digraphs are sink-free, which has to be added as an additional precondition in Lemma 9, Lemma 11, Theorem 4. Correspondingly, Algorithm 2 requires that its input is sink-free. The second correction concerns an additional necessary condition in Theorem 9 required to characterize best match graphs. The amended results simplify the construction of least resolved trees for \(n\)-cBMGs, i.e., Algorithm 1. All other results remain unchanged and are correct as stated.

MSC:

00Bxx Conference proceedings and collections of articles
05C05 Trees
68R10 Graph theory (including graph drawing) in computer science
92-10 Mathematical modeling or simulation for problems pertaining to biology
92B10 Taxonomy, cladistics, statistics in mathematical biology

Citations:

Zbl 1415.92133
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bryant, D.; Steel, M., Extension operations on sets of leaf-labeled trees, Adv Appl Math, 16, 425-453 (1995) · Zbl 0863.92012
[2] Deng, Y.; Fernández-Baca, D., Fast compatibility testing for rooted phylogenetic trees, Algorithmica, 80, 2453-2477 (2018) · Zbl 1392.68451
[3] Geiß, M.; Chávez, E.; González Laffitte, M.; López Sánchez, A.; Stadler, BMR; Valdivia, DI; Hellmuth, M.; Hernández Rosales, M.; Stadler, PF, Best match graphs, J Math Biol, 78, 2015-2057 (2019) · Zbl 1415.92133
[4] Geiß, M.; González Laffitte, ME; López Sánchez, A.; Valdivia, DI; Hellmuth, M.; Hernández Rosales, M.; Stadler, PF, Best match graphs and reconciliation of gene trees with species trees, J Math Biol, 80, 1459-1495 (2020) · Zbl 1434.05035
[5] Schaller, D.; Geiß, M.; Stadler, PF; Hellmuth, M., Complete characterization of incorrect orthology assignments in best match graphs, J Math Biol (2021) · Zbl 1460.92149
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.