Corrigendum to "Best match graphs"

David Schaller, Manuela Geiß, Edgar Chávez, Marcos González Laffitte, Alitzel López Sánchez, Bärbel M. R. Stadler, Dulce I. Valdivia, Marc Hellmuth, Maribel Hernández Rosales, Peter F. Stadler
2021 Journal of Mathematical Biology  
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
more » ... resolved trees for n-cBMGs, i.e., Algorithm 1. All other results remain unchanged and are correct as stated.
doi:10.1007/s00285-021-01601-6 pmid:33818665 fatcat:q3aciozqxbhu5h75qcv3sgijbu