Solving the structure of protein-protein complexes is one of the most important tasks in structural biology. Even though there has been great progress in recent years there still a small number of protein complexes structures deposited in the Protein Data Bank in comparison to isolated partners. In this sense, the computational prediction of protein complexes starting from the unbound structures, protein-protein Docking algorithms, has emerged as a reasonable alternative. Many docking programs employ Fast Fourier Transform (FFT) correlations as an efficient search strategy. We describe an implementation of a protein-protein docking program based on FFT surface complementarity that runs entirely on a Graphics Processing Unit (GPU), including grid generation, rotation and scoring. We evaluate its performance, and show that it can be up to 13 times faster than conventional CPU based implementations.Sociedad Argentina de Informática e Investigación Operativ
