TY - GEN
T1 - Trading running time for memory in phylogenetic likelihood computations
AU - Izquierdo-Carrasco, Fernando
AU - Gagneur, Julien
AU - Stamatakis, Alexandros
PY - 2012
Y1 - 2012
N2 - The revolution in wet-lab sequencing techniques that has given rise to a plethora of whole-genome or whole-transcriptome sequencing projects, often targeting 50 up to 1000 species, poses new challenges for efficiently computing the phylogenetic likelihood function both for phylogenetic inference and statistical post-analysis purposes. The phylogenetic likelihood function as deployed in maximum likelihood and Bayesian inference programs consumes the vast majority of computational resources, that is, memory and CPU time. Here, we introduce and implement a novel, general, and versatile concept to trade additional computations for memory consumption in the likelihood function which exhibits a surprisingly small impact on overall execution times. When trading 50% of the required RAM for additional computations, the average execution time increase because of additional computations amounts to only 15%. We demonstrate that, for a phylogeny with n species only log(n) + 2 memory space is required for computing the likelihood. This is a promising result given the exponential growth of molecular datasets.
AB - The revolution in wet-lab sequencing techniques that has given rise to a plethora of whole-genome or whole-transcriptome sequencing projects, often targeting 50 up to 1000 species, poses new challenges for efficiently computing the phylogenetic likelihood function both for phylogenetic inference and statistical post-analysis purposes. The phylogenetic likelihood function as deployed in maximum likelihood and Bayesian inference programs consumes the vast majority of computational resources, that is, memory and CPU time. Here, we introduce and implement a novel, general, and versatile concept to trade additional computations for memory consumption in the likelihood function which exhibits a surprisingly small impact on overall execution times. When trading 50% of the required RAM for additional computations, the average execution time increase because of additional computations amounts to only 15%. We demonstrate that, for a phylogeny with n species only log(n) + 2 memory space is required for computing the likelihood. This is a promising result given the exponential growth of molecular datasets.
KW - Memory versus runtime trade-offs
KW - Phylogenetic likelihood function
KW - RAxML
UR - http://www.scopus.com/inward/record.url?scp=84861994934&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84861994934
SN - 9789898425904
T3 - BIOINFORMATICS 2012 - Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms
SP - 86
EP - 95
BT - BIOINFORMATICS 2012 - Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms
T2 - International Conference on Bioinformatics Models, Methods and Algorithms, BIOINFORMATICS 2012
Y2 - 1 February 2012 through 4 February 2012
ER -