Best match graphs

Best match graphs arise naturally as the first processing intermediate in algorithms for orthology detection. Let T be a phylogenetic (gene) tree T and [Formula: see text] an assignment of leaves of T to species. The best match graph [Formula: see text] is a digraph that contains an arc from x to y...

Descripción completa

Detalles Bibliográficos
Autores principales: 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 2019
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6534531/
https://www.ncbi.nlm.nih.gov/pubmed/30968198
http://dx.doi.org/10.1007/s00285-019-01332-9

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6534531/
https://www.ncbi.nlm.nih.gov/pubmed/30968198
http://dx.doi.org/10.1007/s00285-019-01332-9

Ejemplares similares