pIQPNNI: Parallel reconstruction of large maximum likelihood phylogenies

Bioinformatics

Volumn 21, Issue 19, 2005, Pages 3794-3796

  Minh, Bui Quang ^a   Vinh, Le Sy ^b   von Haeseler, Arndt ^c   Schmidt, Heiko A ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b FORSCHUNGSZENTRUM JÜLICH   (Germany)

^c HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DNA; PROTEIN;

ARTICLE; BIOINFORMATICS; COMPUTER PROGRAM; DNA DETERMINATION; GENETIC ALGORITHM; MAXIMUM LIKELIHOOD METHOD; PHYLOGENETIC TREE; PRIORITY JOURNAL; PROTEIN DETERMINATION; SEQUENCE ANALYSIS;

EID: 27144503359     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/bti594     Document Type: Article

References (17)

1. Altekar,G. et al. (2004) Parallel metropolis coupled markov chain monte carlo for bayesian phylogenetic inference. Bioinformatics, 20, 407-415.
2. Brent,R.P. (1973) Algorithms for Minimization without Derivatives. Prentice Hall, Englewood Cliffs, NJ, USA.
3. Chor,B. and Tuller,T. (2005) Maximum likelihood of evolutionary trees is hard. In Proceedings of the 9th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2005), volume 3500 of Lecture Notes in Computer Science, ACM Press, NY, USA, pp. 296-310.
4. Felsenstein,J. (1981) Evolutionary trees from DNA sequences: A maximum likelihood approach. J. Mol. Evol., 17, 368-376.
5. Gascuel,O. (1997) BIONJ: An improved version of the NJ algorithm based on a simple model of sequence data. Mol. Biol. Evol., 14, 685-695.
6. Guindon,S. and Gascuel,O. (2003) A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood. Syst. Biol., 52, 696-704.
7. Hasegawa,M. et al. (1985) Dating of the human-ape splitting by a molecular clock of mitochondrial DNA. J. Mol. Evol., 22, 160-174.
8. Keane,T.M. et al. (2005) DPRml: Distributed phylogeny reconstruction by maximum likelihood. Bioinformatics, 21, 969-974.
9. Olsen,G.J. et al. (1994) fastDNAml: A tool for construction of phylogenetic trees of DNA sequences using maximum likelihood. Comput. Appl. Biosci., 10, 41-48.
10. Press,W.H. et al. (1992) Numerical Recipes in C: The Art of Scientific Computing. 2nd edition, Cambridge University Press, Cambridge.
11. Schmidt,H.A. et al. (2002) TREE-PUZZLE: Maximum likelihood phylogenetic analysis using quartets and parallel computing. Bioinformatics, 18, 502-504.
12. Snir,M., Otto,S.W., Huss-Lederman,S., Walker,D.W. and Dongarra,J. (1998) MPI: The Complete Reference - The MPI Core, volume 1. 2nd edition, The MIT Press, Cambridge, Massachusetts.
13. Stamatakis,A. and Ludwig,T. (2004) The AxML program family for phylogenetic tree inference. Concurr. Comput.-Pract. Exp., 16, 975-988.
14. Strimmer,K. and von Haeseler,A. (1996) Quartet puzzling: A quartet maximum-likelihood method for reconstructing tree topologies. Mol. Biol. Evol., 13, 964-969.
15. Vinh,L.S. and von Haeseler,A. (2004) IQPNNI: Moving fast through tree space and stopping in time. Mol. Biol. Evol., 21, 1565-1571.
16. Whelan,S. and Goldman,N. (2001) A general empirical model of protein evolution derived from multiple protein families using a maximum likelihood approach. Mol. Biol. Evol., 18, 691-699.
17. Yang,Z. (2000) Maximum likelihood estimation on large phylogenies and analysis of adaptive evolution in human influenza virus A. J. Mol. Evol., 51, 423-432.