Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Manuela Geiß"'
Publikováno v:
Algorithms for Molecular Biology, Vol 16, Iss 1, Pp 1-32 (2021)
Abstract Background Best match graphs (BMGs) are a class of colored digraphs that naturally appear in mathematical phylogenetics as a representation of the pairwise most closely related genes among multiple species. An arc connects a gene x with a ge
Externí odkaz:
https://doaj.org/article/0691ed3cc2fd411eb070e18cd3e69ee2
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
Publikováno v:
Micromachines, Vol 14, Iss 2, p 442 (2023)
In the past few years, object detection has attracted a lot of attention in the context of human–robot collaboration and Industry 5.0 due to enormous quality improvements in deep learning technologies. In many applications, object detection models
Externí odkaz:
https://doaj.org/article/3bdaacb894654f15b73652f092a7e343
Autor:
Nikolai Nøjgaard, Manuela Geiß, Daniel Merkle, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
Publikováno v:
Algorithms for Molecular Biology, Vol 13, Iss 1, Pp 1-17 (2018)
Abstract Background In the absence of horizontal gene transfer it is possible to reconstruct the history of gene families from empirically determined orthology relations, which are equivalent to event-labeled gene trees. Knowledge of the event labels
Externí odkaz:
https://doaj.org/article/4d253f1ee17e4042964f8fae543eaa7b
Publikováno v:
Algorithms, Vol 14, Iss 4, p 110 (2021)
Best match graphs (BMGs) are vertex-colored digraphs that naturally arise in mathematical phylogenetics to formalize the notion of evolutionary closest genes w.r.t. an a priori unknown phylogenetic tree. BMGs are explained by unique least resolved tr
Externí odkaz:
https://doaj.org/article/fc5d03c86c154bbb99a6c45abe1b163e
Publikováno v:
Theoretical Computer Science. 809:384-393
Reciprocal best match graphs (RBMGs) are vertex colored graphs whose vertices represent genes and the colors the species where the genes reside. Edges identify pairs of genes that are most closely related with respect to an underlying evolutionary tr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42bbbba28e36aa178efaa332b1ebe39c
https://doi.org/10.1016/j.tcs.2019.12.033
https://doi.org/10.1016/j.tcs.2019.12.033
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:
Manuela Geiß, Martin Baresch, Georgios Chasparis, Edwin Schweiger, Nico Teringl, Michael Zwick
Publikováno v:
Communications in Computer and Information Science ISBN: 9783031143427
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a1cf01087dba63052eebab43be9df242
https://doi.org/10.1007/978-3-031-14343-4_22
https://doi.org/10.1007/978-3-031-14343-4_22
Publikováno v:
Journal of Mathematical Biology. 80:865-953
Reciprocal best matches play an important role in numerous applications in computational biology, in particular as the basis of many widely used tools for orthology assessment. Nevertheless, very little is known about their mathematical structure. He
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::415f0fd92ee70924d8ac8f366d83f19f
https://doi.org/10.1007/s00285-019-01444-2
https://doi.org/10.1007/s00285-019-01444-2
Publikováno v:
Journal of Mathematical Biology
Genome-scale orthology assignments are usually based on reciprocal best matches. In the absence of horizontal gene transfer (HGT), every pair of orthologs forms a reciprocal best match. Incorrect orthology assignments therefore are always false posit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4581a13b8d828a88c54c45a45b4f5c05
https://doi.org/10.1007/s00285-021-01564-8
https://doi.org/10.1007/s00285-021-01564-8