The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Docking unbound proteins using shape complementarity, desolvation, and electrostatics
Abstract
A comprehensive docking study was performed on 27 distinct protein‐protein complexes. For 13 test systems, docking was performed with the unbound X‐ray structures of both the receptor and the ligand. For the remaining systems, the unbound X‐ray structure of only molecule was available; therefore the bound structure for the other molecule was used. Our method optimizes desolvation, shape complementarity, and electrostatics using a Fast Fourier Transform algorithm. A global search in the rotational and translational space without any knowledge of the binding sites was performed for all proteins except nine antibodies recognizing antigens. For these antibodies, we docked their well‐characterized binding site—the complementarity‐determining region defined without information of the antigen—to the entire surface of the antigen. For 24 systems, we were able to find near‐native ligand orientations (interface C α root mean square deviation less than 2.5 Å from the crystal complex) among the top 2,000 choices. For three systems, our algorithm could identify the correct complex structure unambiguously. For 13 other complexes, we either ranked a near‐native structure in the top 20 or obtained 20 or more near‐native structures in the top 2,000 or both. The key feature of our algorithm is the use of target functions that are highly tolerant to conformational changes upon binding. If combined with a post‐processing method, our algorithm may provide a general solution to the unbound docking problem. Our program, called ZDOCK, is freely available to academic users (http://zlab.bu.edu/∼rong/dock/). Proteins 2002;47:281–294. © 2002 Wiley‐Liss, Inc.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 systematic study of low-resolution recognition in protein-protein complexes
Vakser, I. A., Matar, O. G., & Lam, C. F. (1999) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.96.15.8477 · Cited by 180
Cited by
The ClusPro web server for protein–protein docking
Kozakov, D., Hall, D. R., Xia, B., Porter, K. A., Padhorny, D., Yueh, C., Beglov, D., & Vajda, S. (2017) · Nature Protocols · doi:10.1038/nprot.2016.169 · Cited by 3,310
PatchDock and SymmDock: servers for rigid and symmetric docking
Schneidman-Duhovny, D., Inbar, Y., Nussinov, R., & Wolfson, H. J. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki481 · Cited by 3,018
ZDOCK server: interactive docking prediction of protein–protein complexes and symmetric multimers
Pierce, B. G., Wiehe, K., Hwang, H., Kim, B.-H., Vreven, T., & Weng, Z. (2014) · Bioinformatics · doi:10.1093/bioinformatics/btu097 · Cited by 1,760
Self-citationZDOCK: 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
Self-citationPIPER: An FFT‐based protein docking program with pairwise potentials
Kozakov, D., Brenke, R., Comeau, S. R., & Vajda, S. (2006) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.21117 · Cited by 865
Metadata
- Authors
- Chen, R., & Weng, Z.
- Venue
- Proteins: Structure, Function, and Bioinformatics
- Publisher
- Wiley
- Published
- 2002-03-15
- Volume
- 47
- Issue
- 3
- Pages
- 281-294
- ISSN
- 0887-3585 (ISSN-L)
- 1097-0134
- OpenAlex
- W2133842820
- Cited by
- 374
- References
- 2
- FWCI
- 5.18
- Type
- journal article
- Language
- en
- Open access
- closed
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.