The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Accelerating and focusing protein–protein docking correlations using multi-dimensional rotational FFT generating functions
Open accessAbstract
Motivation: Predicting how proteins interact at the molecular level is a computationally intensive task. Many protein docking algorithms begin by using fast Fourier transform (FFT) correlation techniques to find putative rigid body docking orientations. Most such approaches use 3D Cartesian grids and are therefore limited to computing three dimensional (3D) translational correlations. However, translational FFTs can speed up the calculation in only three of the six rigid body degrees of freedom, and they cannot easily incorporate prior knowledge about a complex to focus and hence further accelerate the calculation. Furthemore, several groups have developed multi-term interaction potentials and others use multi-copy approaches to simulate protein flexibility, which both add to the computational cost of FFT-based docking algorithms. Hence there is a need to develop more powerful and more versatile FFT docking techniques. Results: This article presents a closed-form 6D spherical polar Fourier correlation expression from which arbitrary multi-dimensional multi-property multi-resolution FFT correlations may be generated. The approach is demonstrated by calculating 1D, 3D and 5D rotational correlations of 3D shape and electrostatic expansions up to polynomial order L=30 on a 2 GB personal computer. As expected, 3D correlations are found to be considerably faster than 1D correlations but, surprisingly, 5D correlations are often slower than 3D correlations. Nonetheless, we show that 5D correlations will be advantageous when calculating multi-term knowledge-based interaction potentials. When docking the 84 complexes of the Protein Docking Benchmark, blind 3D shape plus electrostatic correlations take around 30 minutes on a contemporary personal computer and find acceptable solutions within the top 20 in 16 cases. Applying a simple angular constraint to focus the calculation around the receptor binding site produces acceptable solutions within the top 20 in 28 cases. Further constraining the search to the ligand binding site gives up to 48 solutions within the top 20, with calculation times of just a few minutes per complex. Hence the approach described provides a practical and fast tool for rigid body protein-protein docking, especially when prior knowledge about one or both binding sites is available. Availability: http://www.csd.abdn.ac.uk/hex/ Contact: d.w.ritchie@abdn.ac.uk
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A comprehensive analysis of protein–protein interactions in Saccharomyces cerevisiae
Uetz, P., Giot, L., Cagney, G., Mansfield, T. A., Judson, R. S., Knight, J. R., Lockshon, D., Narayan, V., Srinivasan, M., Pochart, P., et al. (2000) · Nature · doi:10.1038/35001009 · Cited by 4,706
A comprehensive two-hybrid analysis to explore the yeast protein interactome
Ito, T., Chiba, T., Ozawa, R., Yoshida, M., Hattori, M., & Sakaki, Y. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.061034498 · Cited by 3,566
HADDOCK: A Protein−Protein Docking Approach Based on Biochemical or Biophysical Information
Dominguez, C., Boelens, R., & Bonvin, A. M. J. J. (2003) · Journal of the American Chemical Society · doi:10.1021/ja026939x · Cited by 3,187 · cited 2×
“…1865 by guest on A pril 29, 2016 http://bioinform atics.oxfordjournals.org/ D ow nloaded from the HADDOCK program (Dominguez et al., 2003), which use external biochemical or biophysical knowledge about binding sites or interaction residues to filter rigid body…”
BackgroundMethodZDOCK: An initial‐stage protein‐docking algorithm
Chen, R., Li, L., & Weng, Z. (2003) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.10389 · Cited by 1,393 · cited 1×
“When docking the 84 complexes of the Protein Docking Benchmark, blind 3D shape plus electrostatic correlations take around 30 minutes on a contemporary personal computer and find acceptable solutions within the top 20 in 16 cases.”
Method
Cited by
HexServer: an FFT-based protein docking server powered by graphics processors
Macindoe, G., Mavridis, L., Venkatraman, V., Devignes, M.-D., & Ritchie, D. W. (2010) · Nucleic Acids Research · doi:10.1093/nar/gkq311 · Cited by 668
Self-citationNew additions to the ClusPro server motivated by CAPRI
Vajda, S., Yueh, C., Beglov, D., Bohnuud, T., Mottarella, S. E., Xia, B., Hall, D. R., & Kozakov, D. (2017) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.25219 · Cited by 604
Self-citationJin, T., Perry, A., Jiang, J., Smith, P., Curry, J. A., Unterholzner, L., Jiang, Z., Horvath, G., Rathinam, V. A., Johnstone, R. W., et al. (2012) · Immunity · doi:10.1016/j.immuni.2012.02.014 · Cited by 574
Protein–protein docking benchmark version 4.0
Hwang, H., Vreven, T., Janin, J., & Weng, Z. (2010) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.22830 · Cited by 476
Ultra-fast FFT protein docking on graphics processors
Ritchie, D. W., & Venkatraman, V. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq444 · Cited by 368
Self-citationMutations in the NOTCH pathway regulator MIB1 cause left ventricular noncompaction cardiomyopathy
Luxán, G., Casanova, J. C., Martínez-Poveda, B., Prados, B., D'Amato, G., MacGrogan, D., Gonzalez-Rajal, A., Dobarro, D., Torroja, C., Martinez, F., et al. (2013) · Nature Medicine · doi:10.1038/nm.3046 · Cited by 357
Molecular docking as a popular tool in drug design, an in silico travel
de Ruyck, J., Brysbaert, G., Blossey, R., & Lensink, M. (2016) · Advances and Applications in Bioinformatics and Chemistry · doi:10.2147/aabc.s105289 · Cited by 346
Tribolet, L., Cantacessi, C., Pickering, D. A., Navarro, S., Doolan, D. L., Trieu, A., Fei, H., Chao, Y., Hofmann, A., Gasser, R. B., et al. (2015) · Journal of Infectious Diseases · doi:10.1093/infdis/jiu451 · Cited by 48
Metadata
- Authors
- Ritchie, D. W., Kozakov, D., & Vajda, S.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2008-06-30
- Volume
- 24
- Issue
- 17
- Pages
- 1865-1873
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2110585060
- Cited by
- 199
- References
- 4
- FWCI
- 4.84
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.