Marcos González Laffitte
Research Subjects
Marcos González Laffitte has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Alitzel López Sánchez
University of Sherbrooke
2 shared publications - Baerbel M R Stadler
Max Planck Institute for Mathematics in the Sciences
2 shared publications - Dulce I. Valdivia
Centro de Investigación y de Estudios Avanzandos del IPN (CINVESTAV), Irapuato, México
2 shared publications - Edgar Chávez
Centro de Física Aplicada y Tecnología Avanzada, UNAM, Juriquilla, México
2 shared publications - Manuela Geiß
Software Competence Center Hagenberg GmbH
2 shared publications - Marc Hellmuth
Faculty of Mathematics and Computer Science, Leipzig University, Leipzig, Germany
2 shared publications
Latest Publications
- Open Access
- 5 April 2021
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 82 (6) , 1-9
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 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.
- 5 April 2021
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 82 (6) , 1-9
Open AccessCorrigendum 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 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.
- Open Access
Best Match Graphs
THIS IS A CORRECTED VERSION INCLUDING AN APPENDED CORRIGENDUM. Best match graphs arise naturally as the first processing intermediate in algorithms for orthology detection. Let $T$ be a phylogenetic (gene) tree $T$ and $\sigma$ an assignment of leaves of $T$ to species. The best match graph $(G,\sigma)$ is a digraph that contains an arc from $x$ to $y$ if the genes $x$ and $y$ reside in different species and $y$ is one of possibly many (evolutionary) closest relatives of $x$ compared to all other genes contained in the species $\sigma(y)$. Here, we characterize best match graphs and show that it can be decided in cubic time and quadratic space whether $(G,\sigma)$ derived from a tree in this manner. If the answer is affirmative, there is a unique least resolved tree that explains $(G,\sigma)$, which can also be constructed in cubic time.Open AccessBest Match Graphs
THIS IS A CORRECTED VERSION INCLUDING AN APPENDED CORRIGENDUM. Best match graphs arise naturally as the first processing intermediate in algorithms for orthology detection. Let $T$ be a phylogenetic (gene) tree $T$ and $\sigma$ an assignment of leaves of $T$ to species. The best match graph $(G,\sigma)$ is a digraph that contains an arc from $x$ to $y$ if the genes $x$ and $y$ reside in different species and $y$ is one of possibly many (evolutionary) closest relatives of $x$ compared to all other genes contained in the species $\sigma(y)$. Here, we characterize best match graphs and show that it can be decided in cubic time and quadratic space whether $(G,\sigma)$ derived from a tree in this manner. If the answer is affirmative, there is a unique least resolved tree that explains $(G,\sigma)$, which can also be constructed in cubic time.