Efficient computation of the phylogenetic likelihood function on multi-gene alignments and multi-core architectures.
The continuous accumulation of sequence data, for example, due to novel wet-laboratory techniques such as pyrosequencing, coupled with the increasing popularity of multi-gene phylogenies and emerging multi-core processor architectures that face problems of cache congestion, poses new challenges with respect to the efficient computation of the phylogenetic maximum-likelihood (ML) function. Here, we propose two approaches that can significantly speed up likelihood computations that typically represent over 95 per cent of the computational effort conducted by current ML or Bayesian inference programs. Initially, we present a method and an appropriate data structure to efficiently compute the likelihood score on 'gappy' multi-gene alignments. By 'gappy' we denote sampling-induced gaps owing to missing sequences in individual genes (partitions), i.e. not real alignment gaps. A first proof-of-concept implementation in RAXML indicates that this approach can accelerate inferences on large and gappy alignments by approximately one order of magnitude. Moreover, we present insights and initial performance results on multi-core architectures obtained during the transition from an OpenMP-based to a Pthreads-based fine-grained parallelization of the ML function.
Stamatakis
Alexandros
A
Department of Computer Science The Exelixis Lab, Ludwig-Maximilians-Universität München, Amalienstrasse 17, 80333 München, Germany. alexandros.stamatakis@gmail.com
Ott
Michael
M
D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D003198:Computer Simulation; D016013:Likelihood Functions; D010802:Phylogeny; D016415:Sequence Alignment / Q000379:methods*