Corrigendum to “Best match graphs”-Reference-Cited by-同舟云学术

Corrigendum to “Best match graphs”

Published:2021-04-05 Issue:6 Volume:82 Page:
ISSN:0303-6812
Container-title:Journal of Mathematical Biology
language:en
Short-container-title:J. Math. Biol.

Author:

Schaller David,Geiß Manuela,Chávez Edgar,González Laffitte Marcos,López Sánchez Alitzel,Stadler Bärbel M. R.,Valdivia Dulce I.,Hellmuth Marc,Hernández Rosales Maribel,Stadler Peter F.^ORCID

Abstract

AbstractTwo 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.

Funder

Universität Leipzig

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Agricultural and Biological Sciences (miscellaneous),Modelling and Simulation

Link

https://link.springer.com/content/pdf/10.1007/s00285-021-01601-6.pdf

Reference5 articles.

1. Bryant D, Steel M (1995) Extension operations on sets of leaf-labeled trees. Adv Appl Math 16:425–453. https://doi.org/10.1006/aama.1995.1020

2. Deng Y, Fernández-Baca D (2018) Fast compatibility testing for rooted phylogenetic trees. Algorithmica 80:2453–2477. https://doi.org/10.1007/s00453-017-0330-4

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 (2019) Best match graphs. J Math Biol 78:2015–2057. https://doi.org/10.1007/s00285-019-01332-9

4. Geiß M, González Laffitte ME, López Sánchez A, Valdivia DI, Hellmuth M, Hernández Rosales M, Stadler PF (2020) Best match graphs and reconciliation of gene trees with species trees. J Math Biol 80:1459–1495. https://doi.org/10.1007/s00285-020-01469-y

5. Schaller D, Geiß M, Stadler PF, Hellmuth M (2021) Complete characterization of incorrect orthology assignments in best match graphs. J Math Biol. https://doi.org/10.1007/s00285-021-01564-8

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Theory of Gene Family Histories;Methods in Molecular Biology;2024

2. REvolutionH-tl: Reconstruction of Evolutionary Histories tool;Lecture Notes in Computer Science;2024

3. Quasi-best match graphs;Discrete Applied Mathematics;2023-05

4. Best Match Graphs with Binary Trees;IEEE/ACM Transactions on Computational Biology and Bioinformatics;2022

5. The structure of 2-colored best match graphs;Discrete Applied Mathematics;2021-12