The Phylogenetic Likelihood Library

被引:136
作者
Flouri, T. [1 ]
Izquierdo-Carrasco, F. [1 ]
Darriba, D. [1 ]
Aberer, A. J. [1 ]
Nguyen, L. -T. [2 ,3 ]
Minh, B. Q. [2 ]
Von Haeseler, A. [2 ,3 ]
Stamatakis, A. [1 ,4 ]
机构
[1] Heidelberg Inst, Heidelberg Inst Theoret Studies, D-69118 Heidelberg, Germany
[2] Med Univ Vienna, Ctr Integrat Bioinformat Vienna, Max F Perutz Labs, Univ Vienna, A-1030 Vienna, Austria
[3] Univ Vienna, Fac Comp Sci, Bioinformat & Computat Biol, A-1090 Vienna, Austria
[4] Karlsruhe Inst Technol, Inst Theoret Informat, D-76128 Karlsruhe, Germany
基金
奥地利科学基金会;
关键词
Maximum likelihood; parallel computing; phylogenetics; INFERENCE;
D O I
10.1093/sysbio/syu084
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
We introduce the Phylogenetic Likelihood Library (PLL), a highly optimized application programming interface for developing likelihood-based phylogenetic inference and postanalysis software. The PLL implements appropriate data structures and functions that allow users to quickly implement common, error-prone, and labor-intensive tasks, such as likelihood calculations, model parameter as well as branch length optimization, and tree space exploration. The highly optimized and parallelized implementation of the phylogenetic likelihood function and a thorough documentation provide a framework for rapid development of scalable parallel phylogenetic software. By example of two likelihood-based phylogenetic codes we show that the PLL improves the sequential performance of current software by a factor of 2-10 while requiring only 1 month of programming time for integration. We show that, when numerical scaling for preventing floating point underflow is enabled, the double precision likelihood calculations in the PLL are up to 1.9 times faster than those in BEAGLE. On an empirical DNA dataset with 2000 taxa the AVX version of PLL is 4 times faster than BEAGLE (scaling enabled and required). The PLL is available at http://www.libpll.org under the GNU General Public License (GPL).
引用
收藏
页码:356 / 362
页数:7
相关论文
共 22 条
[1]  
Alachiotis N., 2011, 2011 International Conference on Field Programmable Logic and Applications, P417, DOI 10.1109/FPL.2011.83
[2]  
Amdahl Gene M., 1967, AFIPS 67, DOI [10.1145/1465482.1465560, DOI 10.1145/1465482.1465560]
[3]  
Ayres DL, 2012, SYST BIOL, V61, P170, DOI [10.1093/sysbio/syr100, 10.1093/sysbio/sys029]
[4]   Ultrafast Approximation for Phylogenetic Bootstrap [J].
Bui Quang Minh ;
Minh Anh Thi Nguyen ;
von Haeseler, Arndt .
MOLECULAR BIOLOGY AND EVOLUTION, 2013, 30 (05) :1188-1195
[5]  
Darriba D., 2013, IPDPS WORKSH CAMBR M
[6]   Bayesian Phylogenetics with BEAUti and the BEAST 1.7 [J].
Drummond, Alexei J. ;
Suchard, Marc A. ;
Xie, Dong ;
Rambaut, Andrew .
MOLECULAR BIOLOGY AND EVOLUTION, 2012, 29 (08) :1969-1973
[7]  
Felsenstein Joseph, 2004, Inferring phylogenies, V2
[8]   Bio plus plus : Efficient Extensible Libraries and Tools for Computational Molecular Evolution [J].
Gueguen, Laurent ;
Gaillard, Sylvain ;
Boussau, Bastien ;
Gouy, Manolo ;
Groussin, Mathieu ;
Rochette, Nicolas C. ;
Bigot, Thomas ;
Fournier, David ;
Pouyet, Fanny ;
Cahais, Vincent ;
Bernard, Aurelien ;
Scornavacca, Celine ;
Nabholz, Benoit ;
Haudry, Annabelle ;
Dachary, Loic ;
Galtier, Nicolas ;
Belkhir, Khalid ;
Dutheil, Julien Y. .
MOLECULAR BIOLOGY AND EVOLUTION, 2013, 30 (08) :1745-1750
[9]   A Dirichlet Process Prior for Estimating Lineage-Specific Substitution Rates [J].
Heath, Tracy A. ;
Holder, Mark T. ;
Huelsenbeck, John P. .
MOLECULAR BIOLOGY AND EVOLUTION, 2012, 29 (03) :939-955
[10]   Bayesian phylogenetic model selection using reversible jump Markov chain Monte Carlo [J].
Huelsenbeck, JP ;
Larget, B ;
Alfaro, ME .
MOLECULAR BIOLOGY AND EVOLUTION, 2004, 21 (06) :1123-1133