Načítá se...
A polynomial time algorithm for calculating the probability of a ranked gene tree given a species tree
BACKGROUND: The ancestries of genes form gene trees which do not necessarily have the same topology as the species tree due to incomplete lineage sorting. Available algorithms determining the probability of a gene tree given a species tree require exponential computational runtime. RESULTS: In this...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
BioMed Central
2012
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3637458/ https://ncbi.nlm.nih.gov/pubmed/22546066 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/1748-7188-7-7 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|