@inproceedings{51d3d573b84146afb4fdd97c3db5c412,
title = "High-performance algorithm engineering for computational phylogenetics",
abstract = "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.",
author = "Moret, {Bernard M.E.} and Bader, {David A.} and Tandy Warnow",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; International Conference on Computational Science, ICCS 2001 ; Conference date: 28-05-2001 Through 30-05-2001",
year = "2001",
doi = "10.1007/3-540-45718-6_107",
language = "English (US)",
isbn = "3540422331",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "1012--1021",
editor = "Alexandrov, {Vassil N.} and Dongarra, {Jack J.} and Juliano, {Benjoe A.} and Renner, {Rene S.} and {Kenneth Tan}, C.J.",
booktitle = "Computational Science – ICCS 2001 - International Conference, Proceedings",
address = "Germany",
}