Optimization strategies for fast detection of positive selection on phylogenetic trees

Bioinformatics

Volumn 30, Issue 8, 2014, Pages 1129-1137

  Valle, Mario ^a   Schabauer, Hannes ^b,c   Pacher, Christoph ^d   Stockinger, Heinz ^c   Stamatakis, Alexandros ^e,f   Robinson Rechavi, Marc ^b,c   Salamin, Nicolas ^b,c  

^a Centro Svizzero Di Calcolo Scientifico   (Switzerland)

^b UNIVERSITY OF LAUSANNE   (Switzerland)

^c SWISS INSTITUTE OF BIOINFORMATICS   (Switzerland)

^d AIT AUSTRIAN INSTITUTE OF TECHNOLOGY   (Austria)

^e HEIDELBERG INSTITUTE FOR THEORETICAL STUDIES   (Germany)

^f KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CODON;

ALGORITHM; BIOLOGY; CODON; GENETIC SELECTION; MOLECULAR EVOLUTION; PHYLOGENY; SOFTWARE; STATISTICAL MODEL;

ALGORITHMS; CODON; COMPUTATIONAL BIOLOGY; EVOLUTION, MOLECULAR; LIKELIHOOD FUNCTIONS; PHYLOGENY; SELECTION, GENETIC; SOFTWARE;

EID: 84898851126     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btt760     Document Type: Article

References (37)

1. Anisimova, M. and Kosiol, C. (2009) Investigating protein-coding sequence evolution with probabilistic codon substitution models. Mol. Biol. Evol., 26, 255-271.
2. Anisimova, A. and Yang, Z. (2007) Multiple hypothesis testing to detect lineages under positive selection that affects only a few sites. Mol. Biol. Evol., 24, 1219-1228.
3. Bai, Z. et al. (2000) Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide. SIAM, Philadelphia.
4. Comnish-Bowden, A. (1985) Nomenclature for incompletely specified bases in nucleic acid sequences: recommendation 1984. Nucleic Acids Res., 13, 3021-3030.
5. Dongarra, J.J. (2012) High performance computing systems: status and outlook. Acta Numerica, 21, 379-474.
6. Dutheil, J.Y. et al. (2012) Efficient selection of branch-specific models of sequence evolution. Mol. Biol. Evol., 29, 1861-1874.
7. Felsenstein, J. (1981) Evolutionary trees from DNA sequences: a maximum likelihood approach. J. Mol. Evol., 17, 368-376.
8. Foster, I.T. (1995) Designing and Building Parallel Programs. Addison-Wesley, Reading, Mass.
9. Gil, M. et al. (2013) CodonPhyML: fast maximum likelihood phylogeny estimation under codon substitution models. Mol. Biol. Evol., 30, 1270-1280.
10. Golub, G.H. and Van Loan, C.F. (2013) Matrix Computations. 4th edn. Johns Hopkins University Press, Baltimore, MD
11. 4 origins. New Phytol., 193, 304-312.
12. Izquierdo-Carrasco, F. et al. (2011) Algorithms, data structures, and numerics for likelihood-based phylogenetic inference of huge trees. BMC Bioinformatics, 12, 1-14.
13. Kosakovsky Pond, S.L. and Muse, S.V. (2004) Column sorting: rapid calculation of the phylogenetic likelihood function. Syst. Biol., 53, 685-692.
14. Kosiol, C. et al. (2008) Patterns of positive selection in six mammalian genomes. PLoS Genet., 4, e1000144.
15. Kraut, A. et al. (2010) Phylogenetic code in the cloud-can it meet the expectations?. In: HealthGrid. IOS Press, Birmingham, AL, pp. 55-63.
16. Lartillot, N. and Philippe, H. (2004) A bayesian mixture model for across-site heterogeneities in the amino-acid replacement process. Mol. Biol. Evol., 21, 1095-1109.
17. Lemey, P. et al. (2012) A counting renaissance: combining stochastic mapping and empirical Bayes to quickly detect amino acid sites under positive selection. Bioinformatics, 28, 3248-3256.
18. Message Passing Interface Forum. (1994) MPI: a message-passing interface standard. Int. J. Supercomput. Appl. High Performance Comput., 8, 3-4.
19. Murrell, B. et al. (2012) Detecting individual sites subject to episodic diversifying selection. PloS Genet., 8, e1002764.
20. Nielsen, R. (2005) Statistical Methods in Molecular Evolution. Springer, New York.
21. Proux, E. et al. (2009) Selectome: a database of positive selection. Nucleic Acids Res., 37, 404-407.
22. Rannala, B. and Yang, Z. (2008) Phylogenetic inference using whole genomes. Annu. Rev. Genomics Hum. Genet., 9, 217-231.
23. Rodrigue, N. and Aris-Brosou, S. (2011) Fast bayesian choice of phylogenetic models: prospecting data augmentation-based thermodynamic integration. Syst. Biol., 60, 881-887.
24. Schabauer, H. et al. (2012) SlimCodeML: an optimized version of CodeML for the branch-site model. In: 11th International Workshop on High Performance Computational Biology (HiCOMB). IEEE, New York, pp. 700-708.
25. Sedgewick, R. and Wayne, K. (2011) Algorithms. 4th edn. Addison-Wesley, Reading, Mass.
26. Seo, T.K. and Kishino, H. (2008) Synonymous substitutions substantially improve evolutionary inference from highly diverged proteins. Syst. Biol., 57, 367-377.
27. Stamatakis, A. (2011) Orchestrating the phylogenetic likelihood function on emerging parallel architectures. In: Schmidt, B. (ed.) Bioinformatics-High Performance Parallel Computer Architectures. CRC Press, Singapore, pp. 85-115.
28. Stamatakis, A. and Ott, M. (2009) Load balance in the phylogenetic likelihood kernel. In: ICPP. IEEE, New York, pp. 348-355.
29. Stamatakis, A. et al. (2002) AxML: a fast program for sequential and parallel phylo-genetic tree calculations based on the maximum likelihood method. In: Bioinformatics Conference. IEEE, New York, pp. 21-28.
30. Studer, R.A. et al. (2008) Pervasive positive selection on duplicated and nondupli-cated vertebrate protein coding genes. Genome Res., 18, 1393-1402.
31. Sumner, J. and Charleston, M. (2010) Phylogenetic estimation with partial likelihood tensors. J. Theor. Biol., 262, 413-424.
32. Tomko, K.A. (1995) Domain Decomposition, Irregular Applications, and Parallel Computers. Ph.D. thesis, University of Michigan, Michigan.
33. Venditti, C. et al. (2008) Phylogenetic mixture models can reduce node-density artifacts. Syst. Biol., 57, 286-293.
34. Yang, Z. (2006) Computational Molecular Evolution. Oxford University Press, Oxford.
35. Yang, Z. et al. (2005) Bayes empirical bayes inference of amino acid sites under positive selection. Mol. Biol. Evol., 22, 1107-1118.
36. YarKhan, A. et al. (2011) QUARK Users' Guide: QUeueing and Runtime for Kernels. Technical report. University of Tennessee Innovative Computing Laboratory. ICL-UT-11-02, Tennessee.
37. Zhang, J. et al. (2005) Evaluation of an improved branch-site likelihood method for detecting positive selection at the molecular level. Mol. Biol. Evol., 22, 2472-2479.