Corrigendum to “Best match graphs”
Authors:
- David SchallerDSDavid Schaller
- Manuela GeißMGManuela Geiß
- Edgar ChávezECEdgar Chávez
- Marcos González LaffitteMLMarcos González Laffitte
- Alitzel López SánchezASAlitzel López Sánchez
- Bärbel M. R. StadlerBSBärbel M. R. Stadler
- Dulce I. ValdiviaDVDulce I. Valdivia
- Marc HellmuthMHMarc Hellmuth
- Maribel Hernández RosalesMRMaribel Hernández Rosales
- Peter F. StadlerPeter F. Stadler
Open Access
- 5 April 2021
- journal article
- correction
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 82 (6) , 1-9
Abstract
Two errors in the article Best Match Graphs (Geiß et al. in JMB 78: 2015–2057, 2019) 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.Keywords
Funding Information
- Universität Leipzig
This publication has 5 references indexed in Scilit:
- Complete Characterization of Incorrect Orthology Assignments in Best Match GraphsJournal of Mathematical Biology, 2021
- Best match graphs and reconciliation of gene trees with species treesJournal of Mathematical Biology, 2020
- Best match graphsJournal of Mathematical Biology, 2019
- Fast Compatibility Testing for Rooted Phylogenetic TreesAlgorithmica, 2017
- Extension Operations on Sets of Leaf-Labeled TreesAdvances in Applied Mathematics, 1995