High-performance computing selection of models of DNA substitution for multicore clusters

International Journal of High Performance Computing Applications

Volumn 28, Issue 1, 2014, Pages 112-125

  Darriba, Diego ^a,b   Taboada, Guillermo L ^a   Doallo, Ramón ^a   Posada, David ^b  

^a UNIVERSITY OF A CORUÑA   (Spain)

^b UNIVERSITY OF VIGO   (Spain)

Author keywords

High performance computing (HPC); Message Passing in Java (MPJ); multicore cluster; nucleotide substitution; performance evaluation; phylogeny

Indexed keywords

HIGH-PERFORMANCE COMPUTING; MULTI-CORE CLUSTER; NUCLEOTIDE SUBSTITUTION; PERFORMANCE EVALUATION; PHYLOGENY;

BIOINFORMATICS; BIOLOGY; CLUSTER COMPUTING; MESSAGE PASSING; OPTIMIZATION;

MEMORY ARCHITECTURE;

EID: 84892930037     PISSN: 10943420     EISSN: 17412846     Source Type: Journal    
DOI: 10.1177/1094342013495095     Document Type: Article

References (16)

1. Akaike H. A new look at the statistical model identification. IEEE Transactions on Automatic Control. 1974 ; 19 (6). 716-723
2. Buckley TR. Model misspecification and probabilistic tests of topology: evidence from empirical data sets. Systematic Biology. 2002 ; 51: 509-523
3. Buckley TR, Cunningham CW. The effects of nucleotide substitution model assumptions on estimates of nonparametric bootstrap support. Molecular Biology and Evolution. 2002 ; 19: 394-405
4. Chor B, Tuller T. Finding a maximum likelihood tree is hard. Journal of the ACM. 2006 ; 53 (5). 722-744
5. Dagum L, Menon R. OpenMP: An industry-standard API for shared-memory programming. IEEE Computational Science and Engineering. 1998 ; 5 (1). 46-55
6. Darriba D, Taboada GL, Doallo R, Posada D Proceedings of the Workshop on High Performance Computational Systems Biology (HiBi'11), 9th International Conference on Computational Methods in Systems Biology (CMSB'11). France: Paris ; 2011a: 65-72.
7. Darriba D, Taboada GL, Doallo R, Posada D. Prottest 3: fast selection of best-fit models of protein evolution. Bioinformatics. 2011b ; 27: 1164-1165
8. Felsenstein J. Evolutionary trees from DNA sequences: a maximum likelihood approach. Journal of Molecular Evolution. 1981 ; 17: 368-376
9. Felsenstein J. Phylogenies from molecular sequences: inference and reliability. Annual Review of Genetics. 1988 ; 22: 521-565
10. Gascuel O. BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data. Molecular Biology and Evolution. 1997 ; 14 (7). 685-95
11. Guindon O, Gascuel S. A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood. Systematic Biology. 2003 ; 52: 696-704
12. Lemmon AR, Moriarty EC. The importance of proper model assumption in Bayesian phylogenetic. Systematic Biology. 2004 ; 53: 265-277
13. Posada D. jModelTest: phylogenetic model averaging. Molecular Biology and Evolution. 2008 ; 25 (7). 1253-1256
14. Posada D, Crandall KA. Selecting the best-fit model of nucleotide substitution. Systematic Biology. 2001 ; 50 (4). 580-601
15. Schwarz G. Estimating the dimension of a model. Annals of Statistics. 1978 ; 6: 461-464
16. Shafi A, Carpenter B, Baker M. Nested parallelism for multi-core HPC systems using Java. Journal of Parallel and Distributed Computing. 2009 ; 69 (6). 532-545