{"DOI":"10.1007/s00285-021-01601-6","PMID":"33818665","abstract":"AbstractTwo errors in the article Best Match Graphs (Gei\u00df et al. in JMB 78: 2015\u20132057, 2019) are corrected. One concerns the tacit assumption that digraphs are sink-free, which has to be added as an additional precondition in Lemma\u00a09, Lemma\u00a011, Theorem\u00a04. Correspondingly, Algorithm\u00a02 requires that its input is sink-free. The second correction concerns an additional necessary condition in Theorem\u00a09 required to characterize best match graphs. The amended results simplify the construction of least resolved trees for n-cBMGs, i.e., Algorithm\u00a01. All other results remain unchanged and are correct as stated.","author":[{"family":"Schaller","given":"David"},{"family":"Gei\u00df","given":"Manuela"},{"family":"Ch\u00e1vez","given":"Edgar"},{"family":"Gonz\u00e1lez Laffitte","given":"Marcos"},{"family":"L\u00f3pez S\u00e1nchez","given":"Alitzel"},{"family":"Stadler","given":"B\u00e4rbel M. R."},{"family":"Valdivia","given":"Dulce I."},{"family":"Hellmuth","given":"Marc"},{"family":"Hern\u00e1ndez Rosales","given":"Maribel"},{"family":"Stadler","given":"Peter F."}],"id":"unknown","issue":"6","issued":{"date-parts":[[2021,4,5]]},"language":"en","page-first":"47","publisher":"Springer Science and Business Media LLC","title":"Corrigendum to \"Best match graphs\"","type":"article-journal","volume":"82"}