Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 334

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

Huang, Sheng‐You, Zou, Xiaoqin·2008·Proteins: Structure, Function, and Bioinformatics

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1002/prot.21949

Cites

73 of 73 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 334

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

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.