Exploring New Search Algorithms and Hardware for Phylogenetics: RAxML Meets the IBM Cell

  • Authors:
  • A. Stamatakis;F. Blagojevic;D. S. Nikolopoulos;C. D. Antonopoulos

  • Affiliations:
  • School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland;Department of Computer Science, Center for High-end Computing Systems, Virginia Tech, Blacksburg, USA;Department of Computer Science, Center for High-end Computing Systems, Virginia Tech, Blacksburg, USA;Department of Computer and Communications Engineering, University of Thessaly, Volos, Greece

  • Venue:
  • Journal of VLSI Signal Processing Systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

Phylogenetic inference is considered to be one of the grand challenges in Bioinformatics due to the immense computational requirements. RAxML is currently among the fastest and most accurate programs for phylogenetic tree inference under the Maximum Likelihood (ML) criterion. First, we introduce new tree search heuristics that accelerate RAxML by a factor of 2.43 while returning equally good trees. The performance of the new search algorithm has been assessed on 18 real-world datasets comprising 148 up to 4,843 DNA sequences. We then present the implementation, optimization, and evaluation of RAxML on the IBM Cell Broadband Engine. We address the problems and provide solutions pertaining to the optimization of floating point code, control flow, communication, and scheduling of multi-level parallelism on the Cell.