Загрузка...
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...
Сохранить в:
| Главные авторы: | , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
BioMed Central
2012
|
| Предметы: | |
| Online-ссылка: | 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 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|