Fast algorithms for computing phylogenetic divergence time

Background The inference of species divergence time is a key step in most phylogenetic studies. Methods have been available for the last ten years to perform the inference, but the performance of the methods does not yet scale well to studies with hundreds of taxa and thousands of DNA base pairs. Fo...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:BMC bioinformatics Ročník 18; číslo Suppl 15; s. 514 - 13
Hlavní autoři: Crosby, Ralph W., Williams, Tiffani L.
Médium: Journal Article
Jazyk:angličtina
Vydáno: London BioMed Central 06.12.2017
BioMed Central Ltd
BMC
Témata:
Algorithms
Animals
Bioinformatics
Biomedical and Life Sciences
Computational Biology - methods
Computational Biology/Bioinformatics
Computer Appl. in Life Sciences
Divergence time
Life Sciences
MCMC
Microarrays
Phylogenetics
Phylogeny
Primates - classification
Primates - genetics
Sequence Analysis, DNA - methods
Software
Time Factors
Phylogenetics
MCMC
Divergence time
ISSN:1471-2105, 1471-2105
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Background The inference of species divergence time is a key step in most phylogenetic studies. Methods have been available for the last ten years to perform the inference, but the performance of the methods does not yet scale well to studies with hundreds of taxa and thousands of DNA base pairs. For example a study of 349 primate taxa was estimated to require over 9 months of processing time. In this work, we present a new algorithm, AncestralAge, that significantly improves the performance of the divergence time process. Results As part of AncestralAge, we demonstrate a new method for the computation of phylogenetic likelihood and our experiments show a 90% improvement in likelihood computation time on the aforementioned dataset of 349 primates taxa with over 60,000 DNA base pairs. Additionally, we show that our new method for the computation of the Bayesian prior on node ages reduces the running time for this computation on the 349 taxa dataset by 99%. Conclusion Through the use of these new algorithms we open up the ability to perform divergence time inference on large phylogenetic studies.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1471-2105
1471-2105
DOI:10.1186/s12859-017-1916-1