Cited by 338Protein Structure and DynamicsComputational Drug Discovery MethodsMachine Learning in Bioinformatics

BeAtMuSiC: prediction of changes in protein–protein binding affinity on mutations

Open access
Dehouck, Yves, Kwasigroch, Jean Marc, Rooman, Marianne, Gilis, Dimitri·2013·Nucleic Acids Research

Abstract

The ability of proteins to establish highly selective interactions with a variety of (macro)molecular partners is a crucial prerequisite to the realization of their biological functions. The availability of computational tools to evaluate the impact of mutations on protein-protein binding can therefore be valuable in a wide range of industrial and biomedical applications, and help rationalize the consequences of non-synonymous single-nucleotide polymorphisms. BeAtMuSiC (http://babylone.ulb.ac.be/beatmusic) is a coarse-grained predictor of the changes in binding free energy induced by point mutations. It relies on a set of statistical potentials derived from known protein structures, and combines the effect of the mutation on the strength of the interactions at the interface, and on the overall stability of the complex. The BeAtMuSiC server requires as input the structure of the protein-protein complex, and gives the possibility to assess rapidly all possible mutations in a protein chain or at the interface, with predictive performances that are in line with the best current methodologies.

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/nar/gkt450

Cites

51 of 51 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?

  • FoldX and BeAtMuSic yield the lowest correlations and highest RMSE on single-point mutation datasets.

    “We observed FoldX [8] and BeAtMuSic [38] yield the lowest correlations and the highest root-mean-square error (RMSE) on these datasets, indicating the difficulty of gauging the impacts of mutations via empirical energy-based methods.”
  • The final dataset for building mCSM-PPI2 includes 8338 single-point mutations, an increase of up to three-fold compared to previous methods that used data from the first version of SKEMPI.

    “Therefore, the final dataset for building mCSM-PPI2 predictive model includes 8338 single-point mutations (S8338), which represents an increase of up to three-fold in datapoints in comparison with previous methods that used data from the first version of SKEMPI with 2007 (S2007) (20,23), 1964 (S1964) (25), 1102 (S1102) (24) and 1327 (S1327) mutations (41).”
  • Previous methods were limited either in terms of their throughput or in terms of their performance.

    “Previous methods were limited either in terms of their throughput (21,22) or in terms of their performance (23).”
  • mCSM-PPI2 outperformed mCSM, iSEE, FoldX, and BeAtMuSiC on the MDM2-p53 blind test.

    “outperforming mCSM, iSEE, FoldX, BeAtMuSiC (23) (Table 1).”
  • Empirical energy-based methods usually take linear forms, often with only energy-based terms, and fail to exploit evolution information, which can limit their ability to capture mutation effects on binding affinity.

    “They usually take a form of linear functions, often with only energy‐based terms, and fail to exploit evolution information, which can limit their ability to capture mutation effects on binding affinity.”

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
Dehouck, Y., Kwasigroch, J. M., Rooman, M., & Gilis, D.
Affiliations
Université Libre de Bruxelles (BE)
Corresponding author
Dehouck, Yves
Venue
Nucleic Acids Research
Published
2013-05-30
Volume
41
Issue
W1
Pages
W333-W339
ISSN
  • 0305-1048 (ISSN-L)
  • 1362-4962
OpenAlex
W2117541321
Cited by
338
References
51
Citations by year
2026: 11 · 2025: 49 · 2024: 30 · 2023: 40 · 2022: 35 · 2021: 42 · 2020: 26 · 2019: 17 · 2018: 19 · 2017: 18 · 2016: 18 · 2015: 16 · 2014: 14 · 2013: 2
FWCI
7.46
Type
journal article
Language
en
Open access
Locations
  • Nucleic Acids Research (publishedVersion, cc-by-nc)
  • Europe PMC (PubMed Central) (publishedVersion, cc-by-nc)
  • PubMed Central (publishedVersion, cc-by-nc)
  • PubMed (publishedVersion)
  • Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) (submittedVersion, other-oa)
Funders
Fonds De La Recherche Scientifique - FNRS
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
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Machine Learning in Bioinformatics
Keywords
protein-protein binding affinity, point mutations, binding free energy prediction, statistical potentials, protein-protein complex structure, complex stability, non-synonymous single nucleotide polymorphisms
MeSH terms
Models, Molecular, Mutation, Protein Binding, Software, Protein Folding, Internet, Multiprotein Complexes

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