Journal
BIOINFORMATICS
Volume 28, Issue 20, Pages 2689-2690Publisher
OXFORD UNIV PRESS
DOI: 10.1093/bioinformatics/bts492
Keywords
-
Categories
Funding
- National Evolutionary Synthesis Center (NESCent)
- NSF [EF-0905606]
- iPlant Collaborative NSF [EF-0735191]
Ask authors/readers for more resources
Ever larger phylogenies are being constructed due to the explosion of genetic data and development of high-performance phylogenetic reconstruction algorithms. However, most methods for calculating divergence times are limited to datasets that are orders of magnitude smaller than recently published large phylogenies. Here, we present an algorithm and implementation of a divergence time method using penalized likelihood that can handle datasets of thousands of taxa. We implement a method that combines the standard derivative-based optimization with a stochastic simulated annealing approach to overcome optimization challenges. We compare this approach with existing software including r8s, PATHd8 and BEAST.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available