Laddar...
Approximating the correction of weighted and unweighted orthology and paralogy relations
BACKGROUND: Given a gene family, the relations between genes (orthology/paralogy), are represented by a relation graph, where edges connect pairs of orthologous genes and “missing” edges represent paralogs. While a gene tree directly induces a relation graph, the converse is not always true. Indeed,...
Sparad:
| I publikationen: | Algorithms Mol Biol |
|---|---|
| Huvudupphovsmän: | , , |
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Publicerad: |
BioMed Central
2017
|
| Ämnen: | |
| Länkar: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5346272/ https://ncbi.nlm.nih.gov/pubmed/28293276 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/s13015-017-0096-x |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|