Ultra-fast FFT protein docking on graphics processors

David W. Ritchie, Vishwesh Venkatraman
INRIA Nancy-Grand Est, LORIA, 615 Rue du Jardin Botanique, 54506 Vandoeuvre-les-Nancy, France
Bioinformatics, Vol. 26, No. 19. (1 October 2010), pp. 2398-2405.


   title={Ultra-fast FFT protein docking on graphics processors},

   author={Ritchie, D.W. and Venkatraman, V.},







   publisher={Oxford Univ Press}


Download Download (PDF)   View View   Source Source   Source codes Source codes



MOTIVATION: Modelling proteinaprotein interactions (PPIs) is an increasingly important aspect of structural bioinformatics. However, predicting PPIs using in silico docking techniques is computationally very expensive. Developing very fast protein docking tools will be useful for studying large-scale PPI networks, and could contribute to the rational design of new drugs. RESULTS: The Hex spherical polar Fourier protein docking algorithm has been implemented on Nvidia graphics processor units (GPUs). On a GTX 285 GPU, an exhaustive and densely sampled 6D docking search can be calculated in just 15 s using multiple 1D fast Fourier transforms (FFTs). This represents a 45-fold speed-up over the corresponding calculation on a single CPU, being at least two orders of magnitude times faster than a similar CPU calculation using ZDOCK 3.0.1, and estimated to be at least three orders of magnitude faster than the GPU-accelerated version of PIPER on comparable hardware. Hence, for the first time, exhaustive FFT-based protein docking calculations may now be performed in a matter of seconds on a contemporary GPU. Three-dimensional Hex FFT correlations are also accelerated by the GPU, but the speed-up factor of only 2.5 is much less than that obtained with 1D FFTs. Thus, the Hex algorithm appears to be especially well suited to exploit GPUs compared to conventional 3D FFT docking approaches.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: