RAxML-OMP: An efficient program for phylogenetic inference on SMPs

Lecture Notes in Computer Science

Volumn 3606, Issue , 2005, Pages 288-302

  Stamatakis, Alexandros ^a   Ott, Michael ^b   Ludwig, Thomas ^c  

^a INSTITUTE OF COMPUTER SCIENCE   (Greece)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER STORAGE; COMPUTER ARCHITECTURE; MATHEMATICAL MODELS; PARALLEL ALGORITHMS;

MAXIMUM LIKELIHOOD (ML); OPENMP-PARALLELIZATION; PHYLOGENETIC TREES; SYMMETRIC MULTIPROCESSING (SMP) MACHINES;

COMPUTER PROGRAM LISTINGS;

EID: 26844521242     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11535294_25     Document Type: Conference Paper

References (29)

1. Bader, D.A., Moret, B.M.E., Vawter, L.: Industrial Applications of High-Performance Computing for Phylogeny Reconstruction. Proceedings of SPIE IT-Com: Commercial Applications for High-Performance Computing 4528 (2001) 159-168
2. Bininda-Emonds, O.R.P., Brady, S.G., Sanderson, M.J., Kim, J.: Scaling of accuracy in extremely large phylogenetic trees. Proceedings of Pacific Symposium on Biocomputing (2000) 547-558
3. Bodlaender, H.L., Fellows, M.R., Hallett, M.T., Wareham, T., Warnow, T.: The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. Theor. Comp. Sci. 244 (2000) 167-188
4. Day, W.E., Johnson, D.S., Sankoff, D.: The computational Complexity of inferring rooted phylogenies by parsimony. Math. Bios. 81 (1986) 33-42
5. Felsenstein, J.: Evolutionary Trees from DNA Sequences: A Maximum Likelihood Approach. J. Mol. Evol. 17 (1981) 368-376
6. Gascuel, O.: BIONJ: An improved version of the NJ algorithm based on a simple model of sequence data. Mol. Biol. Evol. 14 (1997) 685-695
7. Guindon, S., Gascuel, O.: A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood. Syst. Biol. 52(5) (2003) 696-704
8. Gusfield, D., Eddhu, S., Langley, C.: Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination. Proceedings of 2nd IEEE Computer Society Bioinformatics Conference (2003) 363-371
9. Huelsenbeck, J.P., Ronquist, F., Nielsen, R., Bollback, J.P.: Bayesian Inference and its Impact on Evolutionary Biology. Science 294 (2001) 2310-2314
10. Huelsenbeck, J.P., Larget, B., Miller, R.E., Ronquist, F.: Potential Applications and Pitfalls of Bayesian Inference of Phylogeny. Syst. Biol. 51(5) (2002) 673-688
11. Hyper Transport Technology: www.HYPERTRANSPORT.ORG.
12. Keane, T.M., Naughton, T.J., Travers, S.A.A., Mclnerney, J.O., McCormack, G.P.: DPRml: Distributed Phylogeny Reconstruction by Maximum Likelihood. Bioinformatics 21(7) (2005) 969-974
13. Olsen, G., Matsuda, H., Hagstrom, R., Overbeek, R.: fastdnaml: A Tool for Construction of Phylogenetic Trees of DNA Sequences using Maximum Likelihood. Comput. Appl. Biosci.10 (1994) 41-48
14. OpenMP: WWW.OPENMP.ORG/DRUPAL.
15. PAUP project site: PAUP.CSIT.FSU.EDU.
16. Portland Group High-Performance Compilers and Tools: WWW.PGROUP.COM.
17. PHYLIP downlaod site and list of phylogeny software: EVOLUTION.GENETICS. WASHINGTON.EDU.
18. Schmidt, H.A., Strimmer, K., Vingron, M., Haeseler, A.v.: TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing. Bioinformatics 18 (2002) 502-504
19. Stamatakis, A., Ludwig, T., Meier, H.: RAxML-III: A Fast Program for Maximum Likelihood-based Inference of Large Phylogenetic Trees. Bioinformatics 21(4) (2005) 456-463
20. Stamatakis, A.: An Efficient Program for phylogenetic Inference Using Simulated Annealing. Proceedings of 19th International Parallel and Distributed Processing Symposium (2005) to be published
21. Stewart, C., Hart, D., Berry, D., Olsen, G., Wernert, E., Fischer, W.: Parallel Implementation and Performance of fastdnaml - a Program for Maximum Likelihood Phylogenetic Inference. Proceedings of SC2001 (2001)
22. Strimmer, K., Haeseler, A.v.: Quartet Puzzling: A Maximum-Likelihood Method for Reconstructing Tree Topologies. Mol. Biol. Evol. 13 (1996) 964-969
23. Swofford, D.L., Olsen, G.J., Wadell, P.J., Hillis, D.M.: Phylogenetic Inference. Hillis, D.M., Moritz, C., Mabel, B.K., (editors) Molecular Systematics, Chapter 11 (1996) Sinauer Associates, Sunderland, MA
24. Tang, J., Moret, B.M.E., Cui, L., dePamphilis, C.W.: Phylogenetic reconstruction from arbitrary gene-order data. Proc. 4th IEEE Conf. on Bioinformatics and Bioengineering BIBE'04 (2004) 592-599
25. The TreadMarks Distributed Shared Memory (DSM) System: WWW.CS.RICE.EDU/~WILLY/TREADMARKS/OVERVIEW.HTML
26. VeryFastDNAml: WWW-BIOWEB.PASTEUR.FR/SEQANAL/SOFT-PASTEUR. HTML#VERYFASTDNAML
27. Vinh L.S., Haeseler, A.v.: IQPNNI: Moving fast through tree space and stopping in time. Mol. Biol. Evol. 21(8) (2004) 1565-1571
28. Williams, T.L., Moret, B.M.E.: An Investigation of Phylogenetic Likelihood Methods. Proceedings of 3rd IEEE Symposium on Bioinformatics and Bioengineering (2003)
29. Williams, T.L., Berger-Wolf, B.M., Roshan, U., Warnow, T.: The relationship between maximum parsimony scores and phylogenetic tree topologies. Tech. Report, TR-CS-2004-04 (2004) Department of Computer Science, The University of New Mexico