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

[1]  Ming-Yang Kao,et al.  Phylogeny Reconstruction , 2008, Encyclopedia of Algorithms.

[2]  A. Oskooi.  Molecular Evolution and Phylogenetics , 2008 .

[3]  Thomas Stützle,et al.  Stochastic Local Search , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[4]  Alexandros Stamatakis,et al.  Phylogenetic models of rate heterogeneity: a high performance computing perspective , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[5]  Arndt von Haeseler,et al.  Large Maximum Likelihood Trees , 2006 .

[6]  Derrick J. Zwickl.  Genetic algorithm approaches for the phylogenetic analysis of large biological sequence datasets under the maximum likelihood criterion , 2006 .

[7]  Olivier Gascuel,et al.  Improving the efficiency of SPR moves in phylogenetic tree search methods based on maximum likelihood , 2005, Bioinform..

[8]  Pedro Trancoso,et al.  Initial Experiences Porting a Bioinformatics Application to a Graphics Processor , 2005, Panhellenic Conference on Informatics.

[9]  Arndt von Haeseler,et al.  pIQPNNI: parallel reconstruction of large maximum likelihood phylogenies , 2005, Bioinform..

[10]  Alexandros Stamatakis,et al.  Parallel Divide-and-Conquer Phylogeny Reconstruction by Maximum Likelihood , 2005, HPCC.

[11]  Thomas Ludwig,et al.  RAxML-OMP: An Efficient Program for Phylogenetic Inference on SMPs , 2005, PaCT.

[12]  F. Bäckhed,et al.  Obesity alters gut microbial ecology. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[13]  Tamir Tuller,et al.  Maximum Likelihood of Evolutionary Trees Is Hard , 2005, RECOMB.

[14]  Thomas Ludwig,et al.  DRAxML at home: a distributed program for computation of large phylogenetic trees , 2005, Future Gener. Comput. Syst..

[15]  David A. Bader,et al.  An experimental study of parallel biconnected components algorithms on symmetric multiprocessors (SMPs) , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[16]  Alexandros Stamatakis,et al.  An efficient program for phylogenetic inference using simulated annealing , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[17]  Thomas M. Keane,et al.  DPRml: distributed phylogeny reconstruction by maximum likelihood , 2005, Bioinform..

[18]  Thomas Ludwig,et al.  RAxML-III: a fast program for maximum likelihood-based inference of large phylogenetic trees , 2005, Bioinform..

[19]  G. Giribet,et al.  TNT: Tree Analysis Using New Technology , 2005 .

[20]  R. Meier,et al.  Software Review , 2005 .

[21]  J. Felsenstein.  Evolutionary trees from DNA sequences: A maximum likelihood approach , 2005, Journal of Molecular Evolution.

[22]  Zhihua. Du.  High performance computing for computational biology. , 2005 .

[23]  H. Kishino,et al.  Dating of the human-ape splitting by a molecular clock of mitochondrial DNA , 2005, Journal of Molecular Evolution.

[24]  G. Serio,et al.  A new method for calculating evolutionary substitution rates , 2005, Journal of Molecular Evolution.

[25]  David A. Bader,et al.  Lock-Free Parallel Algorithms: An Experimental Study , 2004, HiPC.

[26]  David A. Bader,et al.  A Framework for Measuring Supercomputer Productivity , 2004, Int. J. High Perform. Comput. Appl..

[27]  Michael P. Cummings,et al.  PAUP* [Phylogenetic Analysis Using Parsimony (and Other Methods)] , 2004 .

[28]  O. Bininda-Emonds.  Phylogenetic Supertrees: Combining Information To Reveal The Tree Of Life , 2004 .

[29]  Sergei L. Kosakovsky Pond,et al.  Column sorting: rapid calculation of the phylogenetic likelihood function. , 2004, Systematic biology.

[30]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[31]  David A. Bader.  An improved, randomized algorithm for parallel selection with an experimental study , 2004, J. Parallel Distributed Comput..

[32]  Thomas Ludwig,et al.  Parallel Inference of a 10.000-Taxon Phylogeny with Maximum Likelihood , 2004, Euro-Par.

[33]  Bernard M. E. Moret,et al.  Rec-I-DCM3: a fast algorithmic technique for reconstructing phylogenetic trees , 2004, Proceedings. 2004 IEEE Computational Systems Bioinformatics Conference, 2004. CSB 2004..

[34]  David A. Bader,et al.  The Euler tour technique and parallel rooted spanning tree , 2004, International Conference on Parallel Processing, 2004. ICPP 2004..

[35]  David A. Bader,et al.  A novel FDTD application featuring OpenMP-MPI hybrid parallelization , 2004, International Conference on Parallel Processing, 2004. ICPP 2004..

[36]  A. von Haeseler,et al.  IQPNNI: moving fast through tree space and stopping in time. , 2004, Molecular biology and evolution.

[37]  K. Strimmer,et al.  TREEFINDER: a powerful graphical analysis environment for molecular phylogenetics , 2004, BMC Evolutionary Biology.

[38]  Albert Y. Zomaya,et al.  Parallel implementation of maximum likelihood methods for phylogenetic analysis , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[39]  David A. Bader,et al.  A fast, parallel spanning tree algorithm for symmetric multiprocessors , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[40]  K. Schleifer,et al.  ARB: a software environment for sequence data. , 2004, Nucleic acids research.

[41]  David A. Bader,et al.  High-Performance Algorithm Engineering for Computational Phylogenetics , 2001, The Journal of Supercomputing.

[42]  Daniel Barker,et al.  LVB: parsimony and simulated annealing in the search for phylogenetic trees , 2000, Bioinform..

[43]  Ziheng Yang.  Maximum likelihood phylogenetic estimation from DNA sequences with variable rates over sites: Approximate methods , 1994, Journal of Molecular Evolution.

[44]  Tandy Warnow,et al.  Algorithmic techniques for improving the speed and accuracy of phylogenetic methods , 2004 .

[45]  Tandy J. Warnow,et al.  Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees , 2004, IEEE Computer Society Computational Systems Bioinformatics Conference.

[46]  David A. Bader,et al.  High-performance algorithms for phylogeny reconstruction with maximum parsimony , 2004 .

[47]  J. Farris.  The Logical Basis of Phylogenetic Analysis , 2004 .

[48]  Alexandros Stamatakis,et al.  COMPUTING LARGE PHYLOGENIES WITH STATISTICAL METHODS: PROBLEMS AND SOLUTIONS , 2004 .

[49]  Bernard M. E. Moret,et al.  Performance of Supertree Methods on Various Data Set Decompositions , 2004 .

[50]  O. Gascuel,et al.  A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood. , 2003, Systematic biology.

[51]  Peng Wang,et al.  Distributed parallel computing using windows desktop systems , 2003, Proceedings of the International Workshop on Challenges of Large Applications in Distributed Environments, 2003..

[52]  A. von Haeseler,et al.  Identifying site-specific substitution rates. , 2003, Molecular biology and evolution.

[53]  David A. Bader,et al.  An exact linear-time algorithm for computing genomic distances under inversions and deletions U , 2003 .

[54]  David A. Bader,et al.  A New Parallel Algorithm for Planarity Testing , 2003 .

[55]  David A. Bader,et al.  Fast character optimization in parsimony phylogeny reconstruction , 2003 .

[56]  David A. Bader,et al.  Evaluating Arithmetic Expressions Using Tree Contraction: A Fast and Scalable Parallel Implementation for Symmetric Multiprocessors (SMPs) (Extended Abstract) , 2002, HiPC.

[57]  Thomas Ludwig,et al.  Accelerating Parallel Maximum Likelihood-Based Phylogenetic Tree Calculations Using Subtree Equality Vectors , 2002, ACM/IEEE SC 2002 Conference (SC'02).

[58]  Matthew J. Brauer,et al.  Genetic algorithms and parallel processing in maximum-likelihood phylogeny inference. , 2002, Molecular biology and evolution.

[59]  Tandy J. Warnow,et al.  Sequence-Length Requirements for Phylogenetic Methods , 2002, WABI.

[60]  David A. Bader,et al.  Generalized block shift network for clusters , 2002 .

[61]  A. Lemmon,et al.  The metapopulation genetic algorithm: An efficient solution for the problem of large phylogeny estimation , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[62]  Keqin Li,et al.  Broadcast on Clusters of SMPs with Optimal Concurrency , 2002, PDPTA.

[63]  Martin Vingron,et al.  TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing , 2002, Bioinform..

[64]  Tandy J. Warnow,et al.  The Accuracy of Fast Phylogenetic Methods for Large Datasets , 2001, Pacific Symposium on Biocomputing.

[65]  D. Swofford.  PAUP*: Phylogenetic analysis using parsimony (*and other methods), Version 4.0b10 , 2002 .

[66]  Donald K. Berry,et al.  Parallel Implementation and Performance of FastDNAml - A Program for Maximum Likelihood Phylogenetic Inference , 2001, ACM/IEEE SC 2001 Conference (SC'01).

[67]  Tandy J. Warnow,et al.  The Performance of Phylogenetic Methods on Trees of Bounded Diameter , 2001, WABI.

[68]  David A. Bader,et al.  Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture , 2001, WAE.

[69]  John P. Huelsenbeck,et al.  MRBAYES: Bayesian inference of phylogenetic trees , 2001, Bioinform..

[70]  David A. Bader,et al.  Industrial applications of high-performance computing for phylogeny reconstruction , 2001, SPIE ITCom.

[71]  Tandy J. Warnow,et al.  Designing fast converging phylogenetic methods , 2001, ISMB.

[72]  D. Pearl,et al.  Stochastic search strategy for estimation of maximum likelihood phylogenetic trees. , 2001, Systematic biology.

[73]  David A. Bader,et al.  A New Implmentation and Detailed Study of Breakpoint Analysis , 2000, Pacific Symposium on Biocomputing.

[74]  B L Maidak,et al.  The RDP-II (Ribosomal Database Project) , 2001, Nucleic Acids Res..

[75]  Évin,et al.  Points of View Taxon Sampling and the Phylogenetic Position of Passeriformes: Evidence from 916 Avian Cytochrome b Sequences , 2001 .

[76]  Ziheng Yang.  Maximum Likelihood Estimation on Large Phylogenies and Analysis of Adaptive Evolution in Human Influenza Virus A , 2000, Journal of Molecular Evolution.

[77]  D. Sankoff,et al.  Comparative Genomics: "Empirical And Analytical Approaches To Gene Order Dynamics, Map Alignment And The Evolution Of Gene Families" , 2000 .

[78]  W. Kress,et al.  Angiosperm phylogeny inferred from 18S rDNA, rbcL, and atpB sequences , 2000 .

[79]  Brendan D. McKay,et al.  TrExML: a maximum-likelihood approach for extensive tree-space exploration , 2000, Bioinform..

[80]  Paul Walton Purdom,et al.  Single column discrepancy and dynamic max-mini optimizations for quickly finding the most parsimonious evolutionary trees , 2000, Bioinform..

[81]  K. Nixon,et al.  The Parsimony Ratchet, a New Method for Rapid Parsimony Analysis , 1999, Cladistics : the international journal of the Willi Hennig Society.

[82]  M. P. Cummings,et al.  PAUP* Phylogenetic analysis using parsimony (*and other methods) Version 4 , 2000 .

[83]  David A. Bader,et al.  GRAPPA runs in record time , 2000 .

[84]  Bernard M. E. Moret,et al.  An Empirical Comparison of Phylogenetic Methods on Chloroplast Gene Order Data in Campanulaceae , 2000 .

[85]  David A. Bader,et al.  Algorithm Engineering for Parallel Computation , 2000, Experimental Algorithmics.

[86]  P. Goloboff.  Analyzing Large Data Sets in Reasonable Times: Solutions for Composite Optima , 1999, Cladistics : the international journal of the Willi Hennig Society.

[87]  Daniel H. Huson,et al.  Disk-Covering, a Fast-Converging Method for Phylogenetic Tree Reconstruction , 1999, J. Comput. Biol..

[88]  Daniel H. Huson,et al.  Solving Large Scale Phylogenetic Problems using DCM2 , 1999, ISMB.

[89]  Alberto Caprara,et al.  Formulations and hardness of multiple sorting by reversals , 1999, RECOMB.

[90]  J. Farris,et al.  Support, Ribosomal Sequences and the Phylogeny Of The Eukaryotes , 1998, Cladistics : the international journal of the Willi Hennig Society.

[91]  David Posada,et al.  MODELTEST: testing the model of DNA substitution , 1998, Bioinform..

[92]  David Sankoff,et al.  Multiple Genome Rearrangement and Breakpoint Phylogeny , 1998, J. Comput. Biol..

[93]  Ron Shamir,et al.  The median problems for breakpoints are NP-complete , 1998, Electron. Colloquium Comput. Complex..

[94]  M. Donoghue,et al.  Analyzing large data sets: rbcL 500 revisited. , 1997, Systematic biology.

[95]  Tandy J. Warnow,et al.  Parsimony is Hard to Beat , 1997, COCOON.

[96]  K. Strimmer,et al.  Quartet Puzzling: A Quartet Maximum-Likelihood Method for Reconstructing Tree Topologies , 1996 .

[97]  Z. Yang,et al.  Among-site rate variation and its impact on phylogenetic analyses. , 1996, Trends in ecology & evolution.

[98]  Salah Dowaji,et al.  Building a parallel branch and bound library , 1996, Solving Combinatorial Optimization Problems in Parallel.

[99]  Hideo Matsuda,et al.  fastDNAmL: a tool for construction of phylogenetic trees of DNA sequences using maximum likelihood , 1994, Comput. Appl. Biosci..

[100]  D. Ord,et al.  PAUP:Phylogenetic analysis using parsi-mony , 1993 .

[101]  William H. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .

[102]  J. Oliver,et al.  The general stochastic model of nucleotide substitution. , 1990, Journal of theoretical biology.

[103]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[104]  William H. Press,et al.  Book-Review - Numerical Recipes in Pascal - the Art of Scientific Computing , 1989 .

[105]  J. A. Studier,et al.  A note on the neighbor-joining algorithm of Saitou and Nei. , 1988, Molecular biology and evolution.

[106]  N. Saitou,et al.  The neighbor-joining method: a new method for reconstructing phylogenetic trees. , 1987, Molecular biology and evolution.

[107]  N. Saito.  The neighbor-joining method : A new method for reconstructing phylogenetic trees , 1987 .

[108]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[109]  William H. Press,et al.  Numerical recipes in C. The art of scientific computing , 1987 .

[110]  D. Faith.  Distance Methods and the Approximation of Most-Parsimonious Trees , 1985 .

[111]  D. Penny,et al.  Branch and bound algorithms to determine minimal evolutionary trees , 1982 .

[112]  W. Li,et al.  Simple method for constructing phylogenetic trees from distance matrices. , 1981, Proceedings of the National Academy of Sciences of the United States of America.

[113]  S. Jeffery.  Evolution of Protein Molecules , 1979 .

[114]  J. Farris.  Estimating Phylogenetic Trees from Distance Matrices , 1972, The American Naturalist.

[115]  W. Fitch.  Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology , 1971 .

[116]  P. Meisel.  Margaret O. Dayhoff: Atlas of Protein Sequence and Structure 1969 (Volume 4) XXIV u. 361 S., 21 Ausklapptafeln, 68 Abb. und zahlreiche Tabellen. National Biomedical Research Foundation, Silver Spring/Maryland 1969. Preis $ 12,50 , 1971 .

[117]  T. Jukes.  CHAPTER 24 – Evolution of Protein Molecules , 1969 .

[118]  M. O. Dayhoff,et al.  Atlas of protein sequence and structure , 1965 .