Phylospaces: reconstructing evolutionary trees in tuple space

Phylospaces is a novel framework for reconstructing evolutionary trees in tuple space, a distributed shared memory that permits processes to communicate and coordinate with each other. Our choice of tuple space as a concurrency model is somewhat unusual, given the prominence and success of pure message passing models, such as MPI. We use phylospaces to devise cooperative Rec-I-DCM3, a population-based strategy for navigating tree space. Cooperative Rec-I-DCM3 is based on Rec-I-DCM3, the fastest sequential algorithm under maximum parsimony. We compare the performance of the algorithms on two datasets consisting of 2,000 and 7,769 taxa, respectively. Our results demonstrate that cooperative Rec-I-DCM3 outperforms its sequential counterpart by at least an order of magnitude

[1]  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..

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

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

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

[5]  Marc Smith,et al.  Cooperative Rec-I-DCM3: A Population-Based Approach for Reconstructing Phylogenies , 2005, 2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology.

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

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

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

[9]  David Gelernter,et al.  Generative communication in Linda , 1985, TOPL.

[10]  David A. Bader,et al.  Parallel Algorithm Design for Branch and Bound , 2005 .

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

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

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

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

[15]  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.

[16]  John M. Mellor-Crummey,et al.  PRec-I-DCM3: A Parallel Framework for Fast and Accurate Large Scale Phylogeny Reconstruction , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

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

[18]  K. Nixon.  The Parsimony Ratchet, a New Method for Rapid Parsimony Analysis , 1999 .

[19]  Enrique Alba,et al.  Parallelism and evolutionary algorithms , 2002, IEEE Trans. Evol. Comput..

[20]  Thomas Ludwig,et al.  A fast program for maximum likelihood-based inference of large phylogenetic trees , 2004, SAC '04.

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