Finding the ΔΔ G spot: Are predictors of binding affinity changes upon mutations in protein–protein interactions ready for it?
Open accessThe DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Abstract
Predicting the structure and thermodynamics of protein–protein interactions (PPIs) are key to a proper understanding and modulation of their function. Since experimental methods might not be able to catch up with the fast growth of genomic data, computational alternatives are therefore required. We present here a review dealing with various aspects of predicting binding affinity changes upon mutations (ΔΔ G). We focus on predictors that consider three‐dimensional structure information to estimate the impact of mutations on the binding affinity of a protein–protein complex, excluding the rigorous free energy perturbation methods. Training and evaluation, ΔΔ G databases, data selection, and existing ΔΔ G predictors are specially emphasized. We also establish the parallel with scoring functions used in docking since those share many similar PPI features with ΔΔG predictors. The field has seen a common evolution of ΔΔ G predictors and scoring functions over time, transforming from purely energetic functions to statistical energy‐based and further to machine learning‐based functions. As machine learning has come to age, limitations in terms of quantity, quality and variety of the available data become the bottlenecks for the future development of these computational methods. This can be alleviated by building infrastructures for data generation, collection and sharing. Further developments can be catalyzed by conducting community‐wide blind challenges for method assessment. This article is categorized under: Structure and Mechanism > Molecular Structures Structure and Mechanism > Computational Biochemistry and Biophysics Molecular and Statistical Mechanics > Molecular Interactions
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Kumar, P., Henikoff, S., & Ng, P. C. (2009) · Nature Protocols · doi:10.1038/nprot.2009.86 · Cited by 6,521 · cited 2×
“The sequence conservation (SIFT score 71 ) was also highly important.”
BackgroundKollman, P. A., Massova, I., Reyes, C., Kuhn, B., Huo, S., Chong, L., Lee, M., Lee, T., Duan, Y., Wang, W., et al. (2000) · Accounts of Chemical Research · doi:10.1021/ar000033j · Cited by 4,978
A survey of cross-validation procedures for model selection
Arlot, S., & Celisse, A. (2010) · Statistics Surveys · doi:10.1214/09-ss054 · Cited by 3,522 · cited 2×
“Additionally, leave-one-group-out CV (LOGCV) is useful to test a model's generalizability, 25 by classifying the data into different groups based on protein properties (e.g., complex type, protein family, sequence identity, structure similarity, etc.).”
MethodHADDOCK: A Protein−Protein Docking Approach Based on Biochemical or Biophysical Information
Dominguez, C., Boelens, R., & Bonvin, A. M. J. J. (2003) · Journal of the American Chemical Society · doi:10.1021/ja026939x · Cited by 3,187
Self-citationThe FoldX web server: an online force field
Schymkowitz, J., Borg, J., Stricher, F., Nys, R., Rousseau, F., & Serrano, L. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki387 · Cited by 2,759
Guerois, R., Nielsen, J. E., & Serrano, L. (2002) · Journal of Molecular Biology · doi:10.1016/s0022-2836(02)00442-4 · Cited by 1,728 · cited 2×
“Early ΔΔ G predictors such as FoldX 56,57 and Rosetta 58 model sidechain conformational changes using rotamer libraries, but these approaches cannot guarantee the identification of the lowest energy conformation.”
BackgroundMethodDeep learning for computational biology
Angermueller, C., Pärnamaa, T., Parts, L., & Stegle, O. (2016) · Molecular Systems Biology · doi:10.15252/msb.20156651 · Cited by 1,473 · cited 1×
“These limitations make it difficult to take full advantage of machine learning methods, and in particular deep learning which is becoming increasingly popular.(99)”
BackgroundPrinciples 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
Deep mutational scanning: a new style of protein science
Fowler, D. M., & Fields, S. (2014) · Nature Methods · doi:10.1038/nmeth.3027 · Cited by 1,287
Shapovalov, M. V., & Dunbrack, R. L. (2011) · Structure · doi:10.1016/j.str.2011.03.019 · Cited by 1,000
Zhou, H., & Zhou, Y. (2002) · Protein Science · doi:10.1110/ps.0217002 · Cited by 902 · cited 1×
“85 Other representative examples of the use of statistical potentials in scoring are DFIRE 86 and SIPPER.”
MethodHot spots—A review of the protein–protein interface determinant amino‐acid residues
Moreira, I. S., Fernandes, P. A., & Ramos, M. J. (2007) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.21396 · Cited by 760
Interactome3D: adding structural details to protein networks
Mosca, R., Céol, A., & Aloy, P. (2013) · Nature Methods · doi:10.1038/nmeth.2289 · Cited by 479
Jankauskaitė, J., Jiménez-García, B., Dapkūnas, J., Fernández-Recio, J., & Moal, I. H. (2019) · Bioinformatics · doi:10.1093/bioinformatics/bty635 · Cited by 389 · cited 1×
“Databases, such as SKEMPI, 28,32 provide the Protein Data Bank (PDB) 46 entry of the highest resolution wildtype complex if more than one structure has been deposited.”
BackgroundAin, Q. U., Aleksandrova, A., Roessler, F. D., & Ballester, P. J. (2015) · WIREs Computational Molecular Science · doi:10.1002/wcms.1225 · Cited by 357
BeAtMuSiC: prediction of changes in protein–protein binding affinity on mutations
Dehouck, Y., Kwasigroch, J. M., Rooman, M., & Gilis, D. (2013) · Nucleic Acids Research · doi:10.1093/nar/gkt450 · Cited by 338
Moal, I. H., & Fernández-Recio, J. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts489 · Cited by 281
Docking, scoring, and affinity prediction in CAPRI
Lensink, M. F., & Wodak, S. J. (2013) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.24428 · Cited by 249
Predicting free energy changes using structural ensembles
Benedix, A., Becker, C. M., de Groot, B. L., Caflisch, A., & Böckmann, R. A. (2009) · Nature Methods · doi:10.1038/nmeth0109-3 · Cited by 234
D3R grand challenge 2015: evaluation of protein-ligand pose and affinity predictions.
Gathiaka, S., Liu, S., Chiu, M., Yang, H., Stuckey, J. A., Kang, Y. N., Delproposto, J., Kubish, G., Dunbar, J. B., Carlson, H. A., et al. (2016) · Journal of Computer-Aided Molecular Design · doi:10.1007/s10822-016-9946-8 · Cited by 207
Gaieb, Z., Liu, S., Gathiaka, S., Chiu, M., Yang, H., Shao, C., Feher, V. A., Walters, W. P., Kuhn, B., Rudolph, M. G., et al. (2018) · Journal of Computer-Aided Molecular Design · doi:10.1007/s10822-017-0088-4 · Cited by 193 · cited 1×
“…in order to assess the state-of-the-art ΔΔ G predictors and further catalyze developments in this field, as has been achieved by CAPRI for docking and scoring in PPIs and the D3R (Drug Design Data Resource) grand challenges 105,106 for protein – small molecule pose and binding affinity prediction.”
MethodXiong, P., Zhang, C., Zheng, W., & Zhang, Y. (2017) · Journal of Molecular Biology · doi:10.1016/j.jmb.2016.11.022 · Cited by 140 · cited 17×
“By combining Boltzmann probability and FoldX ΔΔ G with a simple linear function, BindProfX shows a further improved PCC of 0.738 on 1,131 single mutations of SKEMPI.”
BackgroundMethodInfluentialBrender, J. R., & Zhang, Y. (2015) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1004494 · Cited by 140 · cited 6×
“52,53 Only single point mutations, 44,47,48,51,54 multiple point mutations, 54 or both types 42,49,53 could be selected.”
BackgroundMethodInfluentialPires, D. E. V., & Ascher, D. B. (2016) · Nucleic Acids Research · doi:10.1093/nar/gkw458 · Cited by 134
Predicting the Impact of Missense Mutations on Protein–Protein Binding Affinity
Li, M., Petukh, M., Alexov, E., & Panchenko, A. R. (2014) · Journal of Chemical Theory and Computation · doi:10.1021/ct401022c · Cited by 111 · cited 3×
“50,52,54,61 These methods typically use ensembles of conformations from molecular dynamics simulations, combining the molecular mechanics energies with solvation energies based on a continuum representation of the solvent (PBSA or GBSA schemes).”
BackgroundMethodPetukh, M., Li, M., & Alexov, E. (2015) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1004276 · Cited by 107 · cited 1×
“50,52,54,61 These methods typically use ensembles of conformations from molecular dynamics simulations, combining the molecular mechanics energies with solvation energies based on a continuum representation of the solvent (PBSA or GBSA schemes).”
MethodGeng, C., Vangone, A., Folkers, G. E., Xue, L. C., & Bonvin, A. M. J. J. (2019) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.25630 · Cited by 82 · cited 3×
“…atomic and residue level energies (e.g., FoldX energies) using a RF algorithm, BindProf got a very high CV performance (PCC 0.83) on the dimeric complexes of SKEMPI. iSEE 65 is another predictor based on a limited number of interface structural, evolution and energy-based features (31 in total).”
InfluentialSelf-citationSAAMBE: webserver to predict the charge of binding free energy caused by amino acids mutations
Petukh, M., Dai, L., & Alexov, E. (2016) · International Journal of Molecular Sciences · doi:10.3390/ijms17040547 · Cited by 65
Dourado, D. F. A. R., & Flores, S. C. (2014) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.24634 · Cited by 56
Free energy perturbation calculations of the thermodynamics of protein side-chain mutations
Steinbrecher, T., Abel, R., Clark, A., & Friesner, R. (2017) · Journal of Molecular Biology · doi:10.1016/j.jmb.2017.03.002 · Cited by 46
Natural language processing in text mining for structural modeling of protein complexes
Badal, V. D., Kundrotas, P. J., & Vakser, I. A. (2018) · BMC Bioinformatics · doi:10.1186/s12859-018-2079-4 · Cited by 34 · cited 1×
“A similar approach has been recently published to extract information for the scoring of protein– protein complexes in docking.(101) It is also crucial to provide services and/or build an infrastructure to directly collect new data from the researchers generating them.”
BackgroundGeng, C., Vangone, A., & Bonvin, A. M. J. J. (2016) · Protein Engineering Design and Selection · doi:10.1093/protein/gzw020 · Cited by 28
Self-citation
Cited by
The chemistry of snake venom and its medicinal potential
Oliveira, A. L., Viegas, M. F., da Silva, S. L., Soares, A. M., Ramos, M. J., & Fernandes, P. A. (2022) · Nature Reviews Chemistry · doi:10.1038/s41570-022-00393-7 · Cited by 289
Wang, M., Cang, Z., & Wei, G.-W. (2020) · Nature Machine Intelligence · doi:10.1038/s42256-020-0149-6 · Cited by 202
The Role of Conformational Dynamics and Allostery in Modulating Protein Evolution
Campitelli, P., Modi, T., Kumar, S., & Ozkan, S. B. (2020) · Annual Review of Biophysics · doi:10.1146/annurev-biophys-052118-115517 · Cited by 190
“While mutations occur directly at important regions such as the positions that contribute most to binding free energies (protein interface hotspots) (22, 101), distal mutations far from binding sites could impact function through allosteric regulation.”
BackgroundDeepRank-GNN: a graph neural network framework to learn patterns in protein–protein interfaces
Réau, M., Renaud, N., Xue, L. C., & Bonvin, A. M. J. J. (2023) · Bioinformatics · doi:10.1093/bioinformatics/btac759 · Cited by 190
Self-citationComputational prediction of protein–protein binding affinities
Siebenmorgen, T., & Zacharias, M. (2020) · WIREs Computational Molecular Science · doi:10.1002/wcms.1448 · Cited by 184
Metadata
- Authors
- Geng, C., Xue, L. C., Roel‐Touris, J., & Bonvin, A. M. J. J.
- Venue
- WIREs Computational Molecular Science
- Publisher
- Wiley
- Published
- 2019-01-15
- Volume
- 9
- Issue
- 5
- ISSN
- 1759-0876 (ISSN-L)
- 1759-0884
- OpenAlex
- W2909255640
- Cited by
- 100
- References
- 32
- FWCI
- 3.87
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.