A carregar...
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...
Na minha lista:
| Publicado no: | J Math Biol |
|---|---|
| Main Authors: | , , , , , , , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Springer Berlin Heidelberg
2019
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6534531/ https://ncbi.nlm.nih.gov/pubmed/30968198 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s00285-019-01332-9 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|