title: Efficient Detection of Repeating Sites to Accelerate Phylogenetic Likelihood Calculations.
abstract: The phylogenetic likelihood function (PLF) is the major computational bottleneck in several applications of evolutionary biology such as phylogenetic inference, species delimitation, model selection, and divergence times estimation. Given the alignment, a tree and the evolutionary model parameters, the likelihood function computes the conditional likelihood vectors for every node of the tree. Vector entries for which all input data are identical result in redundant likelihood operations which, in turn, yield identical conditional values. Such operations can be omitted for improving run-time and, using appropriate data structures, reducing memory usage. We present a fast, novel method for identifying and omitting such redundant operations in phylogenetic likelihood calculations, and assess the performance improvement and memory savings attained by our method. Using empirical and simulated data sets, we show that a prototype implementation of our method yields up to 12-fold speedups and uses up to 78% less memory than one of the fastest and most highly tuned implementations of the PLF currently available. Our method is generic and can seamlessly be integrated into any phylogenetic likelihood implementation. [Algorithms; maximum likelihood; phylogenetic likelihood function; phylogenetics].
authors: Scientific Computing Group, Heidelberg Institute for Theoretical Studies, Schoß-wolysbronnenweg 35, 69118 Heidelberg, Germany.
authors: K
authors: K
authors: Kobert
authors: Scientific Computing Group, Heidelberg Institute for Theoretical Studies, Schoβ-wolysbronnenweg 35, 69118 Heidelberg, Germany.|Karlsruhe Institute of Technology, Institute for Theoretical Informatics, Postfach 6980, 76128 Karlsruhe, Germany.
authors: A
authors: A
authors: Stamatakis
authors: Scientific Computing Group, Heidelberg Institute for Theoretical Studies, Schoβ-wolysbronnenweg 35, 69118 Heidelberg, Germany.|Karlsruhe Institute of Technology, Institute for Theoretical Informatics, Postfach 6980, 76128 Karlsruhe, Germany.
authors: T
authors: T
authors: Flouri
mesh_terms: D000465:Algorithms; D002965:Classification / Q000379:methods*; D019143:Evolution, Molecular; D016013:Likelihood Functions; D008954:Models, Biological; D010802:Phylogeny; D012984:Software