The DOI matches its Crossref record; 73 of the 73 references it cites were found in a registry or an index.
An iterative knowledge‐based scoring function for protein–protein recognition
Abstract
Using an efficient iterative method, we have developed a distance‐dependent knowledge‐based scoring function to predict protein–protein interactions. The function, referred to as ITScore‐PP, was derived using the crystal structures of a training set of 851 protein–protein dimeric complexes containing true biological interfaces. The key idea of the iterative method for deriving ITScore‐PP is to improve the interatomic pair potentials by iteration, until the pair potentials can distinguish true binding modes from decoy modes for the protein–protein complexes in the training set. The iterative method circumvents the challenging reference state problem in deriving knowledge‐based potentials. The derived scoring function was used to evaluate the ligand orientations generated by ZDOCK 2.1 and the native ligand structures on a diverse set of 91 protein–protein complexes. For the bound test cases, ITScore‐PP yielded a success rate of 98.9% if the top 10 ranked orientations were considered. For the more realistic unbound test cases, the corresponding success rate was 40.7%. Furthermore, for faster orientational sampling purpose, several residue‐level knowledge‐based scoring functions were also derived following the similar iterative procedure. Among them, the scoring function that uses the side‐chain center of mass (SCM) to represent a residue, referred to as ITScore‐PP(SCM), showed the best performance and yielded success rates of 71.4% and 30.8% for the bound and unbound cases, respectively, when the top 10 orientations were considered. ITScore‐PP was further tested using two other published protein–protein docking decoy sets, the ZDOCK decoy set and the RosettaDock decoy set. In addition to binding mode prediction, the binding scores predicted by ITScore‐PP also correlated well with the experimentally determined binding affinities, yielding a correlation coefficient of R= 0.71 on a test set of 74 protein–protein complexes with known affinities. ITScore‐PP is computationally efficient. The average run time for ITScore‐PP was about 0.03 second per orientation (including optimization) on a personal computer with 3.2 GHz Pentium IV CPU and 3.0 GB RAM. The computational speed of ITScore‐PP(SCM) is about an order of magnitude faster than that of ITScore‐PP. ITScore‐PP and/or ITScore‐PP(SCM) can be combined with efficient protein docking software to study protein–protein recognition. Proteins 2008. © 2008 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
Berman, H. M. (2000) · Nucleic Acids Research · doi:10.1093/nar/28.1.235 · Cited by 40,196
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
A new force field for molecular mechanical simulation of nucleic acids and proteins
Weiner, S. J., Kollman, P. A., Case, D. A., Singh, U. C., Ghio, C., Alagona, G., Profeta, S., & Weiner, P. (1984) · Journal of the American Chemical Society · doi:10.1021/ja00315a051 · Cited by 4,639
An all atom force field for simulations of proteins and nucleic acids
Weiner, S. J., Kollman, P. A., Nguyen, D. T., & Case, D. A. (1986) · Journal of Computational Chemistry · doi:10.1002/jcc.540070216 · Cited by 3,437
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
A geometric approach to macromolecule-ligand interactions
Kuntz, I. D., Blaney, J. M., Oatley, S. J., Langridge, R., & Ferrin, T. E. (1982) · Journal of Molecular Biology · doi:10.1016/0022-2836(82)90153-x · Cited by 2,278
Abagyan, R., Totrov, M., & Kuznetsov, D. (1994) · Journal of Computational Chemistry · doi:10.1002/jcc.540150503 · Cited by 1,699
Miyazawa, S., & Jernigan, R. L. (1985) · Macromolecules · doi:10.1021/ma00145a039 · Cited by 1,536
ZDOCK: 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 4×
“14,15 The decoys were generated from the Benchmark 0.0 of 49 protein–protein complexes by Weng and coworkers, using unbound docking via the ZDOCK software.”
BackgroundMethodInfluentialPrinciples of docking: An overview of search algorithms and a guide to scoring functions
Halperin, I., Ma, B., Wolfson, H., & Nussinov, R. (2002) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.10115 · Cited by 1,294
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
The HDOCK server for integrated protein–protein docking
Yan, Y., Tao, H., He, J., & Huang, S.-Y. (2020) · Nature Protocols · doi:10.1038/s41596-020-0312-x · Cited by 1,857
Self-citationHDOCK: a web server for protein–protein and protein–DNA/RNA docking based on a hybrid strategy
Yan, Y., Zhang, D., Zhou, P., Li, B., & Huang, S.-Y. (2017) · Nucleic Acids Research · doi:10.1093/nar/gkx407 · Cited by 1,458
Self-citationHPEPDOCK: a web server for blind peptide–protein docking based on a hierarchical algorithm
Zhou, P., Jin, B., Li, H., & Huang, S.-Y. (2018) · Nucleic Acids Research · doi:10.1093/nar/gky357 · Cited by 609
Self-citationHuang, S.-Y., Grinter, S. Z., & Zou, X. (2010) · Physical Chemistry Chemical Physics · doi:10.1039/c0cp00151a · Cited by 508
Metadata
- Authors
- Huang, S., & Zou, X.
- Venue
- Proteins: Structure, Function, and Bioinformatics
- Publisher
- Wiley
- Published
- 2008-02-04
- Volume
- 72
- Issue
- 2
- Pages
- 557-579
- ISSN
- 0887-3585 (ISSN-L)
- 1097-0134
- OpenAlex
- W2054394841
- Cited by
- 334
- References
- 73
- FWCI
- 3.10
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An iterative knowledge‐based scoring function for protein–protein recognition. https://app.cochat.ai/papers/10.1002/prot.21949
- The paper
- Huang, S., & Zou, X. (2008). An iterative knowledge‐based scoring function for protein–protein recognition. Proteins: Structure, Function, and Bioinformatics. https://doi.org/10.1002/prot.21949
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.