Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Alitzel López Sánchez"'
Autor:
Alitzel López Sánchez, Manuel Lafond
Publikováno v:
Algorithms for Molecular Biology, Vol 19, Iss 1, Pp 1-19 (2024)
Abstract Background Horizontal gene transfer inference approaches are usually based on gene sequences: parametric methods search for patterns that deviate from a particular genomic signature, while phylogenetic methods use sequences to reconstruct th
Externí odkaz:
https://doaj.org/article/7b57b69e6c1e45348bd704c8433f9cfc
Autor:
Peter F. Stadler, Manuela Geiß, David Schaller, Alitzel López Sánchez, Marcos González Laffitte, Dulce I. Valdivia, Marc Hellmuth, Maribel Hernández Rosales
Publikováno v:
Algorithms for Molecular Biology, Vol 15, Iss 1, Pp 1-20 (2020)
Abstract Background Many of the commonly used methods for orthology detection start from mutually most similar pairs of genes (reciprocal best hits) as an approximation for evolutionary most closely related pairs of genes (reciprocal best matches). T
Externí odkaz:
https://doaj.org/article/b2d7a667623a4363a60d45f12cc82c93
Autor:
Maribel Hernández Rosales, Peter F. Stadler, Manuela Geiß, Dulce I. Valdivia, Marcos González Laffitte, Alitzel López Sánchez, Marc Hellmuth
Publikováno v:
Journal of Mathematical Biology
A wide variety of problems in computational biology, most notably the assessment of orthology, are solved with the help of reciprocal best matches. Using an evolutionary definition of best matches that captures the intuition behind the concept we cla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fdd3a974b38e014a8743b5d601a1e5b6
http://europepmc.org/articles/PMC7052050
http://europepmc.org/articles/PMC7052050
Autor:
Peter F. Stadler, Marcos González Laffitte, Manuela Geiß, Maribel Hernández Rosales, Dulce I. Valdivia, Bärbel M. R. Stadler, Alitzel López Sánchez, Marc Hellmuth, Edgar Chávez, David Schaller
Publikováno v:
Journal of Mathematical Biology
Best match graphs arise naturally as the first processing intermediate in algorithms for orthology detection. Let T be a phylogenetic (gene) tree T and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \use
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7191f8dde7cba08e600156e1e9dce10f
http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-192158
http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-192158
Autor:
Stadler, Peter F., Geiß, Manuela, Schaller, David, Alitzel López Sánchez, Laffitte, Marcos González, Valdivia, Dulce I., Hellmuth, Marc, Rosales, Maribel Hernández
Additional file 1. This file contains the additional figures that are referenced in the text, including an example gene tree with distances, various statistics of the simulated data set, and the additional results.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2dd1ed3381a07238ec889356fabc4491
Autor:
Dulce I. Valdivia, Edgar Chávez, Maribel Hernández Rosales, Bärbel M. R. Stadler, Alitzel López Sánchez, Marcos González Laffitte, Peter F. Stadler, Marc Hellmuth, Manuela Geiß
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 leave
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96a2987e521af10e4624d8cd7afb3bcc