David A. Bader
IEEE Fellow
AAAS Fellow
Professor
College of Computing
Georgia Tech
Atlanta, GA 30332


 
 

 

High-Performance Algorithm Engineering for Computational Phylogenetics

Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet approximations must be of very high quality in order to avoid outright biological nonsense. Thus many biologists have been willing to run farms of processors for many months in order to analyze just one dataset. High-performance algorithm engineering offers a battery of tools that can reduce, sometimes spectacularly, the running time of existing phylogenetic algorithms. We present an overview of algorithm engineering techniques, illustrating them with an application to the ``breakpoint analysis'' method of Sankoff et al., which resulted in the GRAPPA software suite. GRAPPA demonstrated a million-fold speedup in running time (on a variety of real and simulated datasets) over the original implementation. We show how algorithmic engineering techniques are directly applicable to a large variety of challenging combinatorial problems in computational biology.

Publication History

Versions of this paper appeared as:
  1. B.M.E. Moret, D.A. Bader, T. Warnow, ``High-Performance Algorithm Engineering for Computational Phylogenetics,'' presented at the 2001 International Conference on Computational Science (ICCS2001), San Francisco, CA, May 2001.
  2. B.M.E. Moret, D.A. Bader, T. Warnow, ``High-Performance Algorithm Engineering for Computational Phylogenetics,'' The Journal of Supercomputing, 22:99-111, 2002.

Download this report in Adobe PDF

 

 
 

Last updated: July 25, 2004

 




Computational Biology



Parallel Computing



Combinatorics