Corrigendum to “Best match graphs”

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

Descripción completa

Detalles Bibliográficos
Autores principales: 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.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer Berlin Heidelberg 2021
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8021527/
https://www.ncbi.nlm.nih.gov/pubmed/33818665
http://dx.doi.org/10.1007/s00285-021-01601-6
_version_ 1783674764166955008
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.
author_facet 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.
author_sort Schaller, David
collection PubMed
description 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.
format Online
Article
Text
id pubmed-8021527
institution National Center for Biotechnology Information
language English
publishDate 2021
publisher Springer Berlin Heidelberg
record_format MEDLINE/PubMed
spelling pubmed-80215272021-04-21 Corrigendum to “Best match graphs” 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. J Math Biol Article 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. Springer Berlin Heidelberg 2021-04-05 2021 /pmc/articles/PMC8021527/ /pubmed/33818665 http://dx.doi.org/10.1007/s00285-021-01601-6 Text en © The Author(s) 2021 https://creativecommons.org/licenses/by/4.0/Open AccessThis article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/ (https://creativecommons.org/licenses/by/4.0/) .
spellingShingle Article
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.
Corrigendum to “Best match graphs”
title Corrigendum to “Best match graphs”
title_full Corrigendum to “Best match graphs”
title_fullStr Corrigendum to “Best match graphs”
title_full_unstemmed Corrigendum to “Best match graphs”
title_short Corrigendum to “Best match graphs”
title_sort corrigendum to “best match graphs”
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8021527/
https://www.ncbi.nlm.nih.gov/pubmed/33818665
http://dx.doi.org/10.1007/s00285-021-01601-6
work_keys_str_mv AT schallerdavid corrigendumtobestmatchgraphs
AT geißmanuela corrigendumtobestmatchgraphs
AT chavezedgar corrigendumtobestmatchgraphs
AT gonzalezlaffittemarcos corrigendumtobestmatchgraphs
AT lopezsanchezalitzel corrigendumtobestmatchgraphs
AT stadlerbarbelmr corrigendumtobestmatchgraphs
AT valdiviadulcei corrigendumtobestmatchgraphs
AT hellmuthmarc corrigendumtobestmatchgraphs
AT hernandezrosalesmaribel corrigendumtobestmatchgraphs
AT stadlerpeterf corrigendumtobestmatchgraphs

Ejemplares similares