Cited by 173Protein Structure and DynamicsComputational Drug Discovery MethodsEnzyme Structure and Function

Efficient flexible backbone protein-protein docking for challenging targets

Open access
Marze, Nicholas A, Roy Burman, Shourya S, Sheffler, William, Gray, Jeffrey J·2018·Bioinformatics

Published version of a preprint

Abstract

Abstract Computational prediction of protein-protein complex structures facilitates a fundamental understanding of biological mechanisms and enables therapeutics design. Binding-induced conformational changes challenge all current computational docking algorithms by exponentially increasing the conformational space to be explored. To restrict this search to relevant space, some computational docking algorithms exploit the inherent flexibility of the protein monomers to simulate conformational selection from pre-generated ensembles. As the ensemble size expands with increased protein flexibility, these methods struggle with efficiency and high false positive rates. Here, we develop and benchmark a method that efficiently samples large conformational ensembles of flexible proteins and docks them using a novel, six-dimensional, coarse-grained score function. A strong discriminative ability allows an eight-fold higher enrichment of nearnative candidate structures in the coarse-grained phase compared to a previous method. Further, the method adapts to the diversity of backbone conformations in the ensemble by modulating sampling rates. It samples 100 conformations each of the ligand and the receptor backbone while increasing computational time by only 20–80%. In a benchmark set of 88 proteins of varying degrees of flexibility, the expected success rate for blind predictions after resampling is 77% for rigid complexes, 49% for moderately flexible complexes, and 31% for highly flexible complexes. These success rates on flexible complexes are a substantial step forward from all existing methods. Additionally, for highly flexible proteins, we demonstrate that when a suitable conformer generation method exists, RosettaDock 4.0 can dock the complex successfully. Significance Predicting binding-induced conformational plasticity in protein backbones remains a principal challenge in computational protein–protein docking. To date, there are no methods that can reliably dock proteins that undergo more than 1 Å root-mean-squared-deviation of the backbones of the interface residues upon binding. Here, we present a method that samples backbone motions and scores conformations rapidly, obtaining–for the first time–successful docking of nearly 50% of flexible target complexes with backbone conformational change up to 2.2 Å RMSD. This method will be applicable to a broader range of protein docking problems, which in turn will help us understand biomolecular assembly and protein function.

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.1093/bioinformatics/bty355

Cites

58 of 58 references verified0 citation errors · 0 not checkable

Statistics

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Evidence points to the conformational selection binding mechanism, which allows one to precompute the conformational ensemble of the interacting molecule(s) and dock the separate conformers with limited conformational search.

    “In a long-standing debate between the proponents of the “induced-fit” and the “conformational selection” binding mechanisms [21–23], the evidence pointing to the latter allows one to precompute the conformational ensemble of the interacting molecule(s) and dock the separate conformers with limited conformational search [24,25].”

    From Challenges in protein docking (2020) · cites this paper as [24]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Marze, N. A., Roy Burman, S. S., Sheffler, W., & Gray, J. J.
Affiliations
  • Johns Hopkins University (US)
  • Department of Chemical & Biomolecular Engineering, Johns Hopkins University, Baltimore, MD, USA
  • University of Washington (US)
Corresponding author
Gray, Jeffrey J
Venue
Bioinformatics
Published
2018-04-30
Volume
34
Issue
20
Pages
3461-3469
ISSN
  • 1367-4803 (ISSN-L)
  • 1367-4811
OpenAlex
W2778809918
Cited by
173
References
58
Citations by year
2026: 19 · 2025: 29 · 2024: 24 · 2023: 29 · 2022: 23 · 2021: 23 · 2020: 19 · 2019: 5 · 2018: 2
FWCI
4.33
Type
journal article
Language
en
Open access
Locations
  • Bioinformatics (publishedVersion)
  • bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion, cc-by-nc)
  • Europe PMC (PubMed Central) (publishedVersion)
  • PubMed Central (publishedVersion)
  • PubMed (publishedVersion)
Funders
  • National Institutes of Health (R01-GM078221)
  • National Science Foundation (1507736)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Protein Structure and Dynamics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computational Drug Discovery Methods
  • Physical Sciences › Materials Science › Materials Chemistry › Enzyme Structure and Function
Keywords
protein-protein docking, flexible proteins, conformational selection, backbone flexibility, conformational ensembles, blind docking
MeSH terms
Algorithms, Ligands, Protein Binding, Protein Conformation, Proteins, Software

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