| Literature DB >> 33818665 |
David Schaller1, Manuela Geiß2, Edgar Chávez3, Marcos González Laffitte4, Alitzel López Sánchez5, Bärbel M R Stadler1, Dulce I Valdivia6, Marc Hellmuth7, Maribel Hernández Rosales6, Peter F Stadler8,9,10,11,12,13.
Abstract
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.Entities:
Keywords: Colored digraph; Corrigendum; Phylogenetic Combinatorics; Rooted triples
Year: 2021 PMID： 33818665 PMCID： PMC8021527 DOI： 10.1007/s00285-021-01601-6
Source DB: PubMed Journal: J Math Biol ISSN： 0303-6812 Impact factor: 2.259