Computational Grand Challenges in Assembling the Tree of Life: Problems and Solutions

Advances in Computers

Volumn 68, Issue , 2006, Pages 127-176

  Bader, David A ^a   Roshan, Usman ^b   Stamatakis, Alexandros ^c  

^a Georgia Institute of Technology   (United States)

^b University Heights   (United States)

^c EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33751114437     PISSN: 00652458     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0065-2458(06)68004-2     Document Type: Review

References (98)

1. Bader D., Moret B.M.E., and Vawter L. Industrial applications of high-performance computing for phylogeny reconstruction. In: Siegel H. (Ed). Proc. SPIE Commercial Applications for High-Performance Computing, Denver, CO vol. 4528 (2001), SPIE, Bellingham, WA 159-168
2. Moret B.M.E., Wyman S., Bader D., Warnow T., Yan M., "A new implementation and detailed study of breakpoint analysis", in: Proc. 6th Pacific Symp. Biocomputing, PSB 2001, Hawaii, 2001, pp. 583-594
3. Yan M., "High performance algorithms for phylogeny reconstruction with maximum parsimony", PhD thesis, Electrical and Computer Engineering Department, University of New Mexico, Albuquerque, NM, 2004
4. Yan M., Bader D.A., "Fast character optimization in parsimony phylogeny reconstruction", Technical report, Electrical and Computer Engineering Department, The University of New Mexico, Albuquerque, NM, 2003
5. Caprara A. Formulations and hardness of multiple sorting by reversals. RECOMB99, Lyon, France. 3rd Annu. Internat. Conf. Computational Molecular Biology (1999), ACM, New York
6. Pe'er I., Shamir R., "The median problems for breakpoints are NP-complete", Technical Report 71, Electronic Colloquium on Computational Complexity, 1998
7. Swofford D., Olsen G., Waddell P., and Hillis D. Phylogenetic inference. In: Hillis A., Moritz C., and Mable B. (Eds). Molecular Systematics (1996), Sinauer Associates, Sunderland, MA 407-514
8. Nei M., and Kumar S. Molecular Evolution and Phylogenetics (2000), Oxford Univ. Press, Oxford, UK
9. Faith D. Distance method and the approximation of most-parsimonious trees. Systematic Zoology 34 (1985) 312-325
10. Farris J. Estimating phylogenetic trees from distance matrices. Amer. Naturalist 106 (1972) 645-668
11. Li W.H. Simple method for constructing phylogenetic trees from distance matrices. Proc. Natl. Acad. Sci. USA 78 (1981) 1085-1089
12. Saitou N., and Nei M. The neighbor-joining method: A new method for reconstruction of phylogenetic trees. Mol. Biol. Evol. 4 (1987) 406-425
13. Studier J., and Keppler K. A note on the neighbor-joining method of Saitou and Nei. Mol. Biol. Evol. 5 (1988) 729-731
14. Rice K., Warnow T., "Parsimony is hard to beat", in: Computing and Combinatorics, 1997, pp. 124-133
15. Hendy M., and Penny D. Branch and bound algorithms to determine minimal evolutionary trees. Math. Biosci. 59 (1982) 277-290
16. Fitch W. Toward defining the course of evolution: Minimal change for a specific tree topology. Systematic Zoology 20 (1971) 406-416
17. Purdom Jr., Bradford P., Tamura K., and Kumar S. Single column discrepancy and dynamic max-mini optimization for quickly finding the most parsimonious evolutionary trees. Bioinformatics 2 16 (2000) 140-151
18. Eck R., and Dayhoff M. Atlas of Protein Sequence and Structure (1966), National Biomedical Research Foundation, Silver Spring, MD
19. Benaïchouche M., Cung V., Dowaji S., Cun B., Mautor T., and Roucairol C. Building a parallel branch and bound library. In: Ferreira A., and Pardalos P. (Eds). Solving Combinatorial Optimization Problem in Parallel: Methods and Techniques (1996), Springer-Verlag, Berlin 201-231
20. Swofford D., and Begle D. PAUP: Phylogenetic Analysis Using Parsimony (1993), Sinauer Associates, Sunderland, MA
21. Felsenstein J. PHYLIP-phylogeny inference package (version 3.2). Cladistics 5 (1989) 164-166
22. Goloboff P. Analyzing large data sets in reasonable times: Solutions for composite optima. Cladistics 15 (1999) 415-428
23. Nixon K. The parsimony ratchet, a new method for rapid parsimony analysis. Cladistics 15 (1999) 407-414
24. Sankoff D., and Blanchette M. Multiple genome rearrangement and breakpoint phylogeny. J. Comput. Biol. 5 (1998) 555-570
25. Cosner M., Jansen R., Moret B.M.E., Raubeson L., Wang L.S., Warnow T., and Wyman S. An empirical comparison of phylogenetic methods on chloroplast gene order data in Campanulaceae. In: Sankoff D., and Nadeau J. (Eds). Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families (2000), Kluwer Academic, Dordrecht, Netherlands 99-121
26. Bader D., and Moret B.M.E. GRAPPA runs in record time. HPCwire 9 47 (2000)
27. Giribet G. A review of TNT: Tree analysis using new technology. Syst. Biol. 54 1 (2005) 176-178
28. Meier R., and Ali F. The newest kid on the parsimony block: TNT (tree analysis using new technology. Syst. Entomol. 30 (2005) 179-182
29. Goloboff P. Analyzing large data sets in reasonable times: solution for composite optima. Cladistics 15 (1999) 415-428
30. Swofford D.L. PAUP*: Phylogenetic Analysis Using Parsimony (and Other Methods), Version 4.0 (1996), Sinauer Associates, Underland, MA
31. Stamatakis A., Ludwig T., and Meier H. RAxML-III: A fast program for maximum likelihood-based inference of large phylogenetic trees. Bioinformatics 21 4 (2005) 456-463
32. Huson D., Nettles S., and Warnow T. Disk-covering, a fast-converging method for phylogenetic tree reconstruction. J. Comput. Biol. 6 (1999) 369-386
33. Huson D., Vawter L., and Warnow T. Solving large scale phylogenetic problems using DCM2. ISMB'99. Proc. 7th Internat. Conf. on Intelligent Systems for Molecular Biology (1999), AAAI Press, Menlo Park, CA 118-129
34. Roshan U., Moret B.M.E., Warnow T., Williams T.L., "Rec-I-DCM3: a fast algorithmic technique for reconstructing large phylogenetic trees", in: Proc. of CSB04, Stanford, CA, 2004
35. Roshan U., "Algorithmic techniques for improving the speed and accuracy of phylogenetic methods", PhD thesis, The University of Texas at Austin, 2004
36. Roshan U., Moret B.M.E., Williams T.L., and Warnow T. Performance of supertree methods on various dataset decompositions. In: Bininda-Emonds O.R.P. (Ed). Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life (2004), Kluwer Academic, Dordrecht/Norwell, MA 301-328
37. Nakhleh L., Roshan U., John K., Sun J., and Warnow T. Designing fast converging phylogenetic methods. ISMB'01. Proc. 9th Internat. Conf. on Intelligent Systems for Molecular Biology (2001), Oxford Univ. Press, Oxford, UK S190-S198
38. Nakhleh L., Moret B.M.E., Roshan U., John K.S., and Warnow T. The accuracy of fast phylogenetic methods for large datasets. PSB'2002. Proc. 7th Pacific Symp. Biocomputing (2002), World Scientific Publ., Singapore 211-222
39. Nakhleh L., Roshan U., John K., Sun J., and Warnow T. The performance of phylogenetic methods on trees of bounded diameter. Proc. of WABI'01 (2001), Springer-Verlag, Berlin 214-226
40. Moret B.M.E., Roshan U., Warnow T., "Sequence length requirements for phylogenetic methods", in: Proc. of WABI'02, 2002, pp. 343-356
41. Golumbic M. Algorithmic Graph Theory and Perfect Graphs (1980), Academic Press, San Diego, CA
42. Hoos H.H., and Stutzle T. Stochastic Local Search: Foundations and Applications (2004), Morgan Kaufmann, San Francisco, CA
43. Du Z., Stamatakis A., Lin F., Roshan U., Nakhleh L., "Parallel divide-and-conquer phylogeny reconstruction by maximum likelihood", in: 2005 International Conference on High Performance Computing and Communications, pp. 776-785
44. 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", in: Proceedings of the 14th IEEE/ACM Supercomputing Conference, SC2001, 2001
45. Ludwig W., Strunk O., Westram R., Richter L., Meier H., Yadhukumar, Buchner A., Lai T., Steppi S., Jobb G., Fvrster W., Brettske I., Gerber S., Ginhart A.W., Gross O., Grumann S., Hermann S., Jost R., Kvnig A., Liss T., Lubmann R., May M., Nonhoff B., Reichel B., Strehlow R., Stamatakis A., Stuckman N., Vilbig A., Lenke M., Ludwig T., Bode A., and Schleifer K.H. ARB: a software environment for sequence data. Nucl. Acids Res. 32 4 (2004) 1363-1371
46. Vinh L., and Haeseler A. IQPNNI: Moving fast through tree space and stopping in time. Mol. Biol. Evol. 21 (2004) 1565-1571
47. Maidak B.L., Cole J.R., Lilburn T.G., Parker Jr. C.T., Saxman P.R., Farris R.J., Garrity G.M., Olsen G.J., Schmidt T.M., and Tiedje J.M. The RDP-II (Ribosomal Database Project). Nucl. Acids Res. 29 1 (2001) 173-174
48. Lipscomb D., Farris J., Kallersjo M., and Tehler A. Support, ribosomal sequences and the phylogeny of the eukaryotes. Cladistics 14 (1998) 303-338
49. Rice K., Donoghue M., and Olmstead R. Analyzing large datasets: rbcL 500 revisited. Syst. Biol. 46 3 (1997) 554-563
50. Soltis D.E., Soltis P.S., Chase M.W., Mort M.E., Albach D.C., Zanis M., Savolainen V., Hahn W.H., Hoot S.B., Fay M.F., Axtell M., Swensen S.M., Prince L.M., Kress W.J., Nixon K.C., and Farris J.S. Angiosperm phylogeny inferred from 18s rDNA, rbcL, and atpB sequences. Botanical J. Linnean Soc. 133 (2000) 381-461
51. Johnson K.P. Taxon sampling and the phylogenetic position of Passeriformes: Evidence from 916 avian cytochrome b sequences. Syst. Biol. 50 1 (2001) 128-136
52. Felsenstein J., "PHYLIP (phylogeny inference package) version 3.6". Distributed by the author, Department of Genome Sciences, University of Washington, Seattle, 2004
53. Swofford D.L., and Olsen G.J. Phylogeny reconstruction. In: Hillis D., Moritz C., and Marble B.K. (Eds). Molecular Systematics. second ed. (1996), Sinauer Associates, Sunderland, MA 407-514
54. Felsenstein J. Evolutionary trees from DNA sequences: A maximum likelihood approach. J. Mol. Evol. 17 (1981) 368-376
55. Ley R., Backhed F., Turnbaugh P., Lozupone C., Knight R., and Gordon J. Obesity alters gut microbial ecology. Proc. Natl. Acad. Sci. USA 102 31 (2005) 11070-11075
56. Chor B., Tuller T., "Maximum likelihood of evolutionary trees is hard", in: Proc. of RECOMB05, 2005
57. Stamatakis A., Ludwig T., and Meier H. RAxML-III: A fast program for maximum likelihood-based inference of large phylogenetic trees. Bioinformatics 21 4 (2005) 456-463
58. Guindon S., and Gascuel O. A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood. Syst. Biol. 52 5 (2003) 696-704
59. Brauer M., Holder M., Dries L., Zwickl D., Lewis P., and Hillis D. Genetic algorithms and parallel processing in maximum-likelihood phylogeny inference. Mol. Biol. Evol. 19 (2002) 1717-1726
60. Lemmon A., and Milinkovitch M. The metapopulation genetic algorithm: An efficient solution for the problem of large phylogeny estimation. Proc. Natl. Acad. Sci. 99 (2001) 10516-10521
61. Jobb G., Haeseler A., and Strimmer K. TREEFINDER: A powerful graphical analysis environment for molecular phylogenetics. BMC Evol. Biol. 4 (2004)
62. Kosakovsky-Pond S., and Muse S. Column sorting: Rapid calculation of the phylogenetic likelihood function. Syst. Biol. 53 5 (2004) 685-692
63. Stamatakis A., Ludwig T., Meier H., Wolf M. "Accelerating parallel maximum likelihood-based phylogenetic tree calculations using subtree equality vectors", in: Proc. of 15th IEEE/ACM Supercomputing Conference, SC2002, 2002
64. Swofford D., and Olsen G. Phylogeny reconstruction. In: Hillis D., and Moritz C. (Eds). Molecular Systematics (1990), Sinauer Associates, Sunderland, MA 411-501
65. Lanave C., Preparata G., Saccone C., and Serio G. A new method for calculating evolutionary substitution rates. J. Mol. Evol. 20 (1984) 86-93
66. Rodriguez F., Oliver J., Marin A., and Medina J. The general stochastic model of nucleotide substitution. J. Theor. Biol. 142 (1990) 485-501
67. Jukes T., and Cantor III C. Evolution of Protein Molecules (1969), Academic Press, New York pp. 21-132
68. Hasegawa M., Kishino H., and Yano T. Dating of the human-ape splitting by a molecular clock of mitochondrial DNA. J. Mol. Evol. 22 (1985) 160-174
69. Posada D., and Crandall K. Modeltest: testing the model of DNA substitution. Bioinformatics 14 9 (1998) 817-818
70. Olsen G., Matsuda H., Hagstrom R., and Overbeek R. fastDNAml: A tool for construction of phylogenetic trees of DNA sequences using maximum likelihood. Comput. Appl. Biosci. 20 (1994) 41-48
71. Yang Z. Among-site rate variation and its impact on phylogenetic analyses. Trends Ecol. Evol. 11 (1996) 367-372
72. Olsen G., Pracht S., and Overbeek R. DNArates distribution. http://geta.life.uiuc.edu/~gary/programs/DNArates.html unpublished, 1998
73. Meyer S., and Haeseler V A. Identifying site-specific substitution rates. Mol. Biol. Evol. 20 (2003) 182-189
74. Yang Z. Maximum likelihood phylogenetic estimation from DNA sequences with variable rates over sites. J. Mol. Evol. 39 (1994) 306-314
75. Stamatakis A., "Phylogenetic models of rate heterogeneity: A high performance computing perspective", in: Proc. of IPDPS2006, Rhodos, Greece, 2006
76. Zwickl D., "Genetic algorithm approaches for the phylogenetic analysis of large biological sequence datasets under the maximum likelihood criterion", PhD thesis, University of Texas at Austin, 2006
77. Hordijk W., and Gascuel O. Improving the efficiency of SPR moves in phylogenetic tree search methods based on maximum likelihood. Bioinformatics (2005)
78. Strimmer K., and Haeseler A. Quartet puzzling: A maximum-likelihood method for reconstructing tree topologies. Mol. Biol. Evol. 13 (1996) 964-969
79. Stamatakis A. "An efficient program for phylogenetic inference using simulated annealing", in: Proc. of IPDPS2005, Denver, CO, 2005
80. Salter L., and Pearl D. A stochastic search strategy for estimation of maximum likelihood phylogenetic trees. Syst. Biol. 50 1 (2001) 7-17
81. Barker D. LVB: Parsimony and simulated annealing in the search for phylogenetic trees. Bioinformatics 20 (2004) 274-275
82. 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", in: Proc. of SC2001, 2001
83. Hart D., Grover D., Liggett M., Repasky R., Shields C., Simms S., Sweeny A., Wang P., "Distributed parallel computing using Windows desktop system", in: Proc. of CLADE, 2003
84. Keane T., Naughton T., Travers S., McInerney J., and McCormack G. DPRml: Distributed phylogeny reconstruction by maximum likelihood. Bioinformatics 21 7 (2005) 969-974
85. Wolf M., Easteal S., Kahn M., McKay B., and Jermiin L. TrExML: A maximum likelihood program for extensive tree-space exploration. Bioinformatics 16 4 (2000) 383-394
86. Zhou B., Till M., Zomaya A., Jermiin L., "Parallel implementation of maximum likelihood methods for phylogenetic analysis", in: Proc. of IPDPS2004, 2004
87. Schmidt H., Strimmer K., Vingron M., and Haeseler A. Tree-puzzle: maximum likelihood phylogenetic analysis using quartets and parallel computing. Bioinformatics 18 (2002) 502-504
88. Minh B., Vinh L., Haeseler A., and Schmidt H. pIQPNNI-parallel reconstruction of large maximum likelihood phylogenies. Bioinformatics (2005)
89. Du Z., Stamatakis A., Lin F., Roshan U., Nakhleh L., "Parallel divide-and-conquer phylogeny reconstruction by maximum likelihood", in: Proc. of HPCC-05, 2005, pp. 776-785
90. Stamatakis A., Lindermeier M., Ott M., Ludwig T., and Meier H. DRAxML@home: A distributed program for computation of large phylogenetic trees. Future Generation Comput. Syst. 51 5 (2005) 725-730
91. Stamatakis A., Ludwig T., Meier H., "Parallel inference of a 10.000-taxon phylogeny with maximum likelihood", in: Proc. of Euro-Par2004, 2004, pp. 997-1004
92. Stamatakis A., Ott M., Ludwig T., "RAxML-OMP: An efficient program for phylogenetic inference on SMPs", in: Proc. of PaCT05, 2005, pp. 288-302
93. Huelsenbeck J., and Ronquist F. MrBayes: Bayesian inference of phylogenetic trees. Bioinformatics 17 (2001) 754-755
94. Press W., Teukolsky S., Vetterling W., and Flannery B. Numerical Recipes in C: The Art of Scientific Computing (1992), Cambridge Univ. Press, New York
95. Yang Z. Maximum likelihood estimation on large phylogenies and analysis of adaptive evolution in human influenza virus A. J. Mol. Evol. 51 (2000) 423-432
96. Charalambous M., Trancoso P., Stamatakis A., "Initial experiences porting a bioinformatics application to a graphics processor", in: Proceedings of the 10th Panhellenic Conference on Informatics, PCI 2005, 2005, pp. 415-425
97. Minh B., Schmidt H., Haeseler A., "Large maximum likelihood trees", Technical report, John von Neumann Institute for Computing, Jülich, Germany, 2006
98. Buck I., Foley T., Horn D., Sugerman J., Hanrahan P., Houston M., and Fatahalian K. BrookGPU website (2005). http://graphics.stanford.edu/projects/brookgpu/index.html