Parallel and Distributed Computation of Large Phylogenetic Trees - Parallel Computing for Bioinformatics and Computational Biology - page 346

25. A. Lemmon and M. Milinkovitch, The metapopulation genetic algorithm: an efficient
solution for the problem of large phylogeny estimation, Proc. Natl. Acad. Sci. USA , 99,
10516-10521 (2002).
26. M. J. Brauer, M. T. Holder, L. A. Dries, D. J. Zwickl, P. O. Lewis, and D. M. Hillis,
Genetic algorithms and parallel processing in maximum-likelihood phylogeny inference,
Mol. Biol. Evol. , 19, 1717-1726 (2002).
27. L. Salter and D. Pearl, Stochastic search strategy for estimation of maximum likelihood
phylogenetic trees, Syst. Biol. , 50, 7-17 (2001).
28. M. T. Holder, P. O. Lewis, Phylogeny estimation: traditional and Bayesian approaches,
Nat. Rev. Genet. , 4, 275-284 (2003).
29. J. P. Huelsenbeck, B. Larget, R. E. Miller, and F. Ronquist, Potential applications and
pitfalls of Bayesian inference of phylogeny, Syst. Biol. , 51 (5), 673-688 (2002).
30. PHYLIP package: EVOLUTION.GENETICS.WASHINGTON.EDU .
31. C. Tuffley and M. Steel, Links between maximum likelihood and maximum parsimony
under a simple model of site substitution, Bull. Math. Biol. , 59 (3), 581-607 (1997).
32. A. Stamatakis, T. Ludwig, and H. Meier, New Fast and Accurate Heuristics for Inference
of Large Phylogenetic Trees, in Proceedings of 18th International Parallel and Distributed
Processing Symposium (IPDPS2004) , 2004, p. 193.
33. A. Stamatakis, T. Ludwig, and H. Meier, Parallel Inference of a 10,000-taxon Phylogeny
with Maximum Likelihood, in Proceedings of Euro-Par 2004 , Vol. 3149 of Lecture Notes
in Computer Science, Springer Verlag, 2004, pp. 997-1004.
34. Seti@home project site: SETIATHOME.SSL.BERKELEY.EDU .
35. A. Stamatakis, M. Ott, T. Ludwig, and H. Meier, DRAxML@home: a distributed pro-
gram for computation of large phylogenetic trees, Future Generation Comp. Sys. , 21(5),
725-730, 2005.
36. M. J. Sanderson and A. C. Driskell, The challenge of constructing large phylogenetic trees,
Trends Plant Sci. , 8 (8), 374-378 (2003).
37. D. Huson, S. Nettles, and T. Warnow, Disk-covering, a fast converging method for
phylogenetic tree reconstruction, Comp. Biol. , 6 (3), 369-386 (1999).
38. D. Huson, L. Vawter, and T. Warnow, Solving Large Scale Phylogenetic Problems Using
DCM2, in Proceedings of ISMB99 , 1999, pp. 118-129.
39. U. Roshan, B. M. E. Moret, T. L. Williams, and T. Warnow, Rec-I-DCM3: A Fast Algorith-
mic Technique for Reconstructing Large Phylogenetic Trees, in Proceedings of 3rd IEEE
Computational Systems Bioinformatics Conference (CSB2004) , 2004.
40. M. L. Bonet, M. Steel, T. Warnow, and S. Yooseph, Better methods for solving parsimony
and compatibility, J. Comp. Biol. , 5, 391-408 (1998).
41. L. S. Vinh, H. A. Schmidt, and A. Haeseler, PhyNav: a novel approach to reconstruct large
phylogenies, Proceedings of GfKl Conference , 2004.
42. J. P. Huelsenbeck and F. Ronquist, MRBAYES: Bayesian inference of phylogenetic trees,
Bioinformatics , 17 (8), 754-755 (2001).
43. OpenMP: WWW.OPENMP.ORG / DRUPAL .
44. J. Krüger and R. Westermann, Linear algebra operators for GPU implementation of
numerical algorithms, Proceedings of SIGGRAPH2003 , 2003, pp. 908-916.
45. Intel Math Kernel Library: WWW.INTEL.COM / SOFTWARE / PRODUCTS / MKL .