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
Descripción
Sumario: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.

Ejemplares similares