Corrigendum to: ``Best match graphs

DOI10.1007/s00285-021-01601-6OpenAlexW3140312363WikidataQ113905532 ScholiaQ113905532MaRDI QIDQ2022091

Marcos González Laffitte, Marc Hellmuth, Bärbel M. R. Stadler, Manuela Geiß, Edgar Chávez, Peter F. Stadler, Dulce I. Valdivia, Maribel Hernandez-Rosales, David Schaller, Alitzel López Sánchez

Publication date: 27 April 2021

Published in: Journal of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00285-021-01601-6

zbMATH Keywords

corrigendumcolored digraphphylogenetic combinatoricsrooted triples

Mathematics Subject Classification ID

Trees (05C05) Taxonomy, cladistics, statistics in mathematical biology (92B10) Graph theory (including graph drawing) in computer science (68R10) Conference proceedings and collections of articles (00Bxx) Mathematical modeling or simulation for problems pertaining to biology (92-10)

Related Items (6)

Least resolved trees for two-colored best match graphs ⋮ Quasi-best match graphs ⋮ The structure of 2-colored best match graphs ⋮ Indirect identification of horizontal gene transfer ⋮ Best match graphs and reconciliation of gene trees with species trees ⋮ Best match graphs with binary trees

Cites Work

• Fast compatibility testing for rooted phylogenetic trees
• Extension operations on sets of leaf-labelled trees
• Best match graphs and reconciliation of gene trees with species trees
• Best match graphs
• Complete characterization of incorrect orthology assignments in best match graphs

This page was built for publication: Corrigendum to: ``Best match graphs