HexServer: an FFT-based protein docking server powered by graphics processors

  title={HexServer: an FFT-based protein docking server powered by graphics processors},
  author={Gary Macindoe and Lazaros Mavridis and Vishwesh Venkatraman and Marie-Dominique Devignes and David W. Ritchie},
  journal={Nucleic Acids Research},
  pages={W445 - W449}
HexServer (http://hexserver.loria.fr/) is the first Fourier transform (FFT)-based protein docking server to be powered by graphics processors. Using two graphics processors simultaneously, a typical 6D docking run takes ∼15 s, which is up to two orders of magnitude faster than conventional FFT-based docking approaches using comparable resolution and scoring functions. The server requires two protein structures in PDB format to be uploaded, and it produces a ranked list of up to 1000 docking… 

Figures and Tables from this paper

Using Graphics Processors to Accelerate Protein Docking Calculations

The FFT-based "Hex" rigid-body docking algorithm is adapted to exploit the computational power of modern graphics processors (GPUs), yet significant further speed-ups have been obtained by using GPUs.

Ultra-fast FFT protein docking on graphics processors

The Hex spherical polar Fourier protein docking algorithm has been implemented on Nvidia graphics processor units (GPUs) and for the first time, exhaustive FFT-based protein docking calculations may now be performed in a matter of seconds on a contemporary GPU.

The HDOCK server for integrated protein–protein docking

The HDOCK server is developed for template-based and template-free protein–protein docking, using amino acid sequences or PDB structures as inputs, and can incorporate SAXS data and can be applied to protein–RNA/DNA docking.

PELE web server: atomistic study of biomolecular systems at your fingertips

The PELE web server is introduced, designed to make the whole process of running simulations easier and more practical by minimizing input file demand, providing user-friendly interface and producing abstract outputs (e.g. interactive graphs and tables).

iScore: AnMPI supported software for ranking protein–protein dockingmodels based on a randomwalk graph kernel and support vectormachines

The software for iScore provides executable scripts that fully automate the computational workflow and can be distributed across different processes using Message Passing interface (MPI) and offloaded to GPUs thanks to dedicated CUDA kernels.

GPU.proton.DOCK: Genuine Protein Ultrafast proton equilibria consistent DOCKing

This work proposes workflows for exploring in silico charge mutagenesis effects for large-scale structural bioinformatics and systems biology projects, thus bridging physics of the interactions with analysis of molecular networks.

Computational modeling of protein assemblies.

Meta-server for automatic analysis, scoring and ranking of docking models

This meta-server is designed to analyse large datasets of docking models and rank them by scoring criteria developed in this study, and produces two types of output showing the likelihood of specific residues and clusters of residues to be involved in receptor-ligand interactions, and the ranking of models.

GPU optimizations for a production molecular docking code

The upgrade of GPU PIPER required an entire rewrite, including algorithm changes and moving most remaining non-accelerated CPU code onto the GPU, resulting in a 7x improvement in GPU performance and a 3.3x speedup over the CPU-only code.



ClusPro: a fully automated algorithm for protein-protein docking

ClusPro (http://nrc.bu.edu/cluster) represents the first fully automated, web-based program for the computational docking of protein structures and produces a short list of putative complexes ranked according to their clustering properties, which is automatically sent back to the user via email.

Accelerating and focusing protein-protein docking correlations using multi-dimensional rotational FFT generating functions

6D spherical polar Fourier correlation expression is presented from which arbitrary multi-dimensional multi-property multi-resolution FFT correlations may be generated and it is shown that 5D correlations will be advantageous when calculating multi-term knowledge-based interaction potentials.

The RosettaDock server for local protein–protein docking

The RosettaDock server identifies low-energy conformations of a protein–protein interaction near a given starting configuration by optimizing rigid-body orientation and side-chain conformations.

Protein docking using spherical polar Fourier correlations

A new computational method of docking pairs of proteins by using spherical polar Fourier correlations to accelerate the search for candidate low‐energy conformations, augmented by a rigorous but “soft” model of electrostatic complementarity.

HADDOCK: a protein-protein docking approach based on biochemical or biophysical information.

An approach called HADDOCK (High Ambiguity Driven protein-protein Docking) that makes use of biochemical and/or biophysical interaction data such as chemical shift perturbation data resulting from NMR titration experiments or mutagenesis data to drive the docking process.

ZDOCK: An initial‐stage protein‐docking algorithm

A new scoring function for the initial stage of unbound docking is presented that combines the recently developed pairwise shape complementarity with desolvation and electrostatics and shows superior performance, especially for the antibody‐antigen category of test cases.

PatchDock and SymmDock: servers for rigid and symmetric docking

Two freely available web servers for molecular docking that perform structure prediction of protein–protein and protein–small molecule complexes and the SymmDock method predicts the structure of a homomultimer with cyclic symmetry given theructure of the monomeric unit are described.

GRAMM-X public web server for protein–protein docking

GRAMM-X and its web interface extend the original GRAMM Fast Fourier Transformation methodology by employing smoothed potentials, refinement stage, and knowledge-based scoring and frees users from complex installation of database-dependent parallel software and maintaining large hardware resources needed for protein docking simulations.

Efficient Unbound Docking of Rigid Molecules

A new algorithm for unbound (real life) docking of molecules, whether protein-protein or protein-drug, carrying out rigid docking, with surface variability/flexibility implicitly addressed through liberal intermolecular penetration is presented.

Assessment of blind predictions of protein–protein interactions: Current status of docking methods

The current status of docking procedures for predicting protein–protein interactions starting from their three‐dimensional structure is assessed from a first major evaluation of blind predictions, which reveals genuine progress but also illustrates the remaining serious limitations and points out the need for better scoring functions and more effective ways for handling conformational flexibility.