Cargando…
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...
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: | |
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 |
Ejemplares similares
-
Best match graphs
por: Geiß, Manuela, et al.
Publicado: (2019) -
Best match graphs and reconciliation of gene trees with species trees
por: Geiß, Manuela, et al.
Publicado: (2020) -
From pairs of most similar sequences to phylogenetic best matches
por: Stadler, Peter F., et al.
Publicado: (2020) -
Heuristic algorithms for best match graph editing
por: Schaller, David, et al.
Publicado: (2021) -
Complete Characterization of Incorrect Orthology Assignments in Best Match Graphs
por: Schaller, David, et al.
Publicado: (2021)