10
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: not found

      treePL: divergence time estimation using penalized likelihood for large phylogenies.

      Bioinformatics

      Software, Phylogeny, Likelihood Functions, Algorithms

      Read this article at

      ScienceOpenPublisherPubMed
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          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. Source code, example files, binaries and documentation for treePL are available at https://github.com/blackrim/treePL.

          Related collections

          Author and article information

          Journal
          10.1093/bioinformatics/bts492
          22908216

          Chemistry

          Software, Phylogeny, Likelihood Functions, Algorithms

          Comments

          Comment on this article