General Information
| Description | Divergence time estimation using penalized likelihood for large phylogenies |
| Homepage | https://github.com/blackrim/treePL |
Publications
treePL: divergence time estimation using penalized likelihood for large phylogenies
Summary:
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.
Availability:
Source code, example files, binaries and documentation for treePL are available at https://github.com/blackrim/treePL.
Contact:
eebsmith@umich.edu
Supplementary information:
Supplementary data are available at Bioinformatics online.
Related Tools
Next-generation VariationHunter
Published June 2010
Combinatorial algorithms for transposon insertion discovery
A counting renaissance
Published October 2012
Combining stochastic mapping and empirical Bayes to quickly detect amino acid sites under positive selection
FAIR Evaluation
Sorry, you must be signed in to evaluate this object.
