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

@article{Macindoe2010HexServerAF,
  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},
  year={2010},
  volume={38},
  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.

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.

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.

PRUNE and PROBE—two modular web services for protein–protein docking

A single parameter based elimination function is used to eliminate >95% of the poses generated during docking search, in contrast to other multi-parameter-based screening functions, which reduces the computational time significantly, in addition to increasing the chances of selecting native-like models in the top rank list.

Challenges and opportunities of automated protein‐protein docking: HDOCK server vs human predictions in CAPRI Rounds 38‐46

The results validated the HDOCK server as an efficient automated docking protocol for nonexpert users as well as challenges and opportunities of automated docking.

GroScore: Accurate Scoring of Protein-Protein Binding Poses Using Explicit-Solvent Free-Energy Calculations

The potential of free-energy calculations with statistical-mechanical foundation in the context of molecular dynamics simulations with explicit solvent to score a large number of complex poses is explored.
...

References

SHOWING 1-10 OF 14 REFERENCES

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.

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.

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.

Molecular surface recognition: determination of geometric fit between proteins and their ligands by correlation techniques.

A geometric recognition algorithm was developed to identify molecular surface complementarity and was tested and validated by using five known complexes for which the correct relative position of the molecules in the respective adducts was successfully predicted.

A computer vision based technique for 3-D sequence-independent structural comparison of proteins.

The results, obtained without using the sequence order of the chains, confirm published structural analogies that use sequence-dependent techniques and extend previous analogies by detecting geometrically equivalent out-of-sequential-order structural elements which cannot be obtained by current techniques.