Cited by 202Machine Learning in BioinformaticsTopological and Geometric Data AnalysisComputational Drug Discovery Methods

The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index; none of the 27 sources its claims cite is checked for support yet.

A topology-based network tree for the prediction of protein–protein binding affinity changes following mutation

Open access
Wang, Menglun, Cang, Zixuan, Wei, Guo-Wei·2020·Nature Machine Intelligence

Abstract

The ability to predict protein–protein interactions is crucial to our understanding of a wide range of biological activities and functions in the human body, and for guiding drug discovery. Despite considerable efforts to develop suitable computational methods, predicting protein–protein interaction binding affinity changes following mutation (ΔΔG) remains a severe challenge. Algebraic topology, a champion in recent worldwide competitions for protein–ligand binding affinity predictions, is a promising approach to simplifying the complexity of biological structures. Here we introduce element- and site-specific persistent homology (a new branch of algebraic topology) to simplify the structural complexity of protein–protein complexes and embed crucial biological information into topological invariants. We also propose a new deep learning algorithm called NetTree to take advantage of convolutional neural networks and gradient-boosting trees. A topology-based network tree is constructed by integrating the topological representation and NetTree for predicting protein–protein interaction ΔΔG. Tests on major benchmark datasets indicate that the proposed topology-based network tree is an important improvement over the current state of the art in predicting ΔΔG. Persistent homology provides an efficient approach to simplifying the complexity of protein structure. Wang et al. combine this approach with convolutional neural networks and gradient-boosting trees to improve predictions of protein–protein interactions.

Overview

AI snapshot

Written from the paper’s full text.

TL;DR

The paper introduces TopNetTree, combining element- and site-specific persistent homology with CNN-assisted gradient-boosting trees to predict protein–protein binding affinity changes upon mutation (ΔΔG). It reports improved Pearson correlations over prior methods on AB-Bind and SKEMPI benchmarks, including RP 0.65 on AB-Bind S645 and RP 0.82 on SKEMPI 2.0 S4947.

Key findings

  • On the AB-Bind S645 set, TopNetTree achieved an RP of 0.65, about 22% better than the previous best RP of 0.53 from mCSM-AB; excluding 27 non-binders increased RP to 0.68, and a blind test on homology structures gave RP 0.55.
  • On the SKEMPI S1131 set, the method was reported as about 15% more accurate than the best existing method in tenfold cross-validation.
  • On SKEMPI 2.0, TopNetTree achieved RP 0.82 and r.m.s.e. 1.11 kcal mol−1 on S4947; RP 0.79 and r.m.s.e. 1.13 kcal mol−1 on S4169 versus mCSM-PPI2’s RP 0.76 and r.m.s.e. 1.19 kcal mol−1; and RP 0.85 and r.m.s.e. 1.11 kcal mol−1 on S8338 versus mCSM-PPI2’s RP 0.82 and r.m.s.e. 1.18 kcal mol−1.
  • Cross-validation analyses showed inter-protein average/median RP of 0.508/0.541 and intra-protein leave-one-out average/median RP of 0.170/0.215; mutation-region RP values were 0.60 (core), 0.66 (rim), 0.66 (support), 0.65 (interior) and 0.48 (surface).

Methods

  • The model uses element- and site-specific persistent homology: atoms are classified into mutation-site, neighbourhood, antibody, antigen and element-type subsets, with modified distance matrices excluding same-set interactions; H0 barcodes come from Vietoris–Rips filtration, while H1 and H2 barcodes come from alpha complex filtration.
  • H0 barcodes are vectorized by binning the filtration range (for example, [0, 12] Å into 0.5 Å bins) and counting persistence intervals, birth events and death events; H1 and H2 barcodes are summarized by statistics such as sum, maximum, minimum, mean and standard deviation of bar lengths, birth values and death values.
  • A CNN extracts higher-level features from H0; these are combined with H1/H2 statistics and fed into a gradient-boosting tree (GBT) for final prediction. The paper evaluates on AB-Bind S645, SKEMPI S2317/S1131, and SKEMPI 2.0 S4947/S4169/S8338/S787 using RP and r.m.s.e., with tenfold, inter-protein, intra-protein and blind-test protocols.

Limitations

  • Stated: the characterization of birth and death may not be stable against different discretizations, so only H0 barcodes from Vietoris–Rips filtration are used; datasets are relatively small and complex; non-binders are outliers that strongly affect accuracy; intra-protein cross-validation is limited by small per-complex training sets (average 27 samples); surface mutations have small data and small average energy disturbance; model prediction variance is generally lower than experimental variance.
  • Evident from reported results: performance varies strongly across protein families, with negative RP for 1FFW (−0.043) and 1YY9 (−0.068); inter-protein cross-validation (average RP 0.508) and blind tests (homology RP 0.55; S787 RP 0.53) are lower than the main tenfold results.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1038/s42256-020-0149-6

Cites

54 of 54 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

0 of 27 cited sources checked · 0 supported · 0 flagged

  • Findingown data

    TopNetTree achieved an RP of 0.55 in a blind test on homology structures using the rest of the samples as the training set.

    “We also applied a blind test on homology structures using the rest of the samples as the training set, achieving an RP of 0.55, as shown in Fig. 4.”
    Quote in the paperSubstantial claim
  • Findingown data

    The proposed topology-based network tree (TopNetTree) is an important improvement over the current state of the art in predicting protein-protein interaction ΔΔG on major benchmark datasets.

    “Tests on major benchmark datasets indicate that the proposed topology-based network tree is an important improvement over the current state of the art in predicting ΔΔG.”
    Quote in the paperSubstantial claim
    • The authors state this as an assumption: The individual learners in an ensemble are likely to make different mistakes, so summing weak learners reduces overall error.
    • Rests on an assumption: PPI ΔΔG prediction data are highly complex due to 3D structures, whereas the datasets are relatively small.
  • Findingown data

    TopNetTree is about 22% more accurate than the best-existing score of RP = 0.53 (given by mCSM-AB) on the AB-Bind S645 dataset.

    “Our method is about 22% more accurate than the best-existing score of RP = 0.53 (given by mCSM-AB), indicating the power of our TopNetTree.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites Pires et al.21 Pires, D. E. & Ascher, D. B. mCSM-AB: a web server for predicting antibody–antigen affinity changes upon mutation with graph-based signatures. Nucleic Acids Res. 44, W469–W473 (2016). source
  • Findingown data

    TopNetTree is over 100% more accurate in terms of RP than non-machine learning methods such as Rosetta and bASA on the AB-Bind S645 dataset.

    “In comparison with non-machine learning methods such as Rosetta and bASA, our method is over 100% more accurate in terms of RP indicating that our topology-based machine learning methods have a better predictive power for PPI systems.”
    Quote in the paperSubstantial claim
  • Findingown data

    Excluding non-binders from the AB-Bind S645 dataset increased TopNetTree's RP from 0.65 to 0.68.

    “In our case, the RP increased from 0.65 to 0.68 for the same treatment as shown in Fig. 4.”
    Quote in the paperNot a substantial claim
  • It may state two separate claims as one. 15
  • The quote only partly states this claim. 3
  • Probably not a substantial claim. 17
  • It may state two separate claims as one. The quote only partly states this claim.

    Findingown data

    TopNetTree achieved an average RP of 0.53 and r.m.s.e. of 1.45 kcal mol−1 on a blind test of 787 mutations from 24 protein complexes shared between AB-Bind and SKEMPI 2.0 (S787), using S4947 excluding S787 as training.

    “We achieved an average RP of 0.53 and r.m.s.e. of 1.45 kcal mol−1 on this blind test (further details are given in the Supplementary Information).”
    Quote in the paperSubstantial claim
  • It may state two separate claims as one.

    Findingown data

    TopNetTree achieved an average RP of 0.82 and an r.m.s.e. of 1.11 kcal mol−1 for tenfold cross-validation on SKEMPI 2.0 set S4947.

    “We tested set S4947 with the regular tenfold cross-validation, achieving an average RP of 0.82 and an r.m.s.e. of 1.11 kcal mol−1 for the tenfold cross-validation.”
    Quote in the paperSubstantial claim
  • It may state two separate claims as one.

    Findingown data

    On SKEMPI 2.0 set S4169, TopNetTree achieved an average RP of 0.79 and r.m.s.e. of 1.13 kcal mol−1, compared with mCSM-PPI2's average RP of 0.76 and r.m.s.e. of 1.19 kcal mol−1.

    “For set S4169, we obtained an average RP of 0.79 and r.m.s.e. of 1.13 kcal mol−1, compared with the average RP of 0.76 and r.m.s.e. of 1.19 kcal mol−1 achieved by mCSM-PPI2.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites David et al.48
  • It may state two separate claims as one.

    Findingown data

    The AB-Bind S645 set consists of about 20% stabilizing mutations and 80% destabilizing ones, and there are 27 non-binders in the whole dataset.

    “This dataset, called the AB-Bind S645 set, consists of about 20% stabilizing mutations and 80% destabilizing ones; there are 27 non-binders in the whole dataset, which are variants determined not to bind within the sensitivity of the assay.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim. The paper’s conclusions may not depend on it.

    Findingreasoning

    All mutations to alanine have a positive energy change.

    “It is interesting to note that all the mutations to alanine have a positive energy change”
    Quote in the paperNot a substantial claim
  • It may state two separate claims as one.

    Findingreasoning

    In the experimental data, mutations at the core or support region have a higher average energy change of around 1.8 kcal mol−1 (1.72 and 1.91 kcal mol−1, respectively), whereas mutations at the rim or interior region have an average energy change of around 0.8 kcal mol−1 (0.82 and 0.83 kcal mol−1, respectively).

    “In experimental data, mutations at the core or support region have a higher average energy change of around 1.8 kcal mol−1 (1.72 kcal mol−1 and 1.91 kcal mol−1, respectively), whereas mutations at the rim or interior region have an average energy change of around 0.8 kcal mol−1 (0.82 kcal mol−1 and 0.83 kcal mol−1, respectively)”
    Quote in the paperNot a substantial claim
  • It may state two separate claims as one.

    Findingown data

    The model's predicted patterns are remarkably similar to those of experimental data in terms of both average binding energy changes and variance of binding energy changes.

    “Overall, our predicted patterns are remarkably similar to those of experimental data in terms of both average binding energy changes and variance of binding energy changes, as shown in Fig. 5.”
    Quote in the paperSubstantial claim
  • It may state two separate claims as one.

    Findingreasoning

    In intra-protein-level leave-one-out cross-validation within each protein complex, the model reached average/median RP values of 0.170/0.215, significantly lower than the tenfold cross-validation result over the entire dataset.

    “For this test, our model reached average/median RP values of 0.170/0.215, which are significantly lower than the tenfold cross-validation result over the entire dataset.”
    Quote in the paperNot a substantial claim
  • It may state two separate claims as one.

    Findingown data

    In inter-protein-level cross-validation over the 24 protein-protein complexes of the AB-Bind S645 set, the model reached an average RP of 0.508 and a median RP of 0.541.

    “For this test, our model reached an average RP of 0.508 and a median RP of 0.541.”
    Quote in the paperSubstantial claim
  • It may state two separate claims as one.

    Findingown data

    The proposed TopNetTree achieves an RP of 0.65, which is about 22% better than the previous best result for the AB-Bind dataset.

    “We demonstrate that the proposed TopNetTree achieves an RP of 0.65, which is about 22% better than the previous best result for the AB-Bind dataset.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.

    Premisecitation

    The AB-Bind database contains 1,101 mutation data entries, including 645 single-point mutations on 32 different antibody-antigen complexes.

    “Sirin et al.10 collected an AB-Bind database of mutation-induced antibody–antigen complex binding free energy changes. This database contains 1,101 mutation data entries, including 645 single-point mutations on 32 different antibody–antigen complexes.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites Sirin et al.10 Sirin, S., Apgar, J. R., Bennett, E. M. & Keating, A. E. AB-bind: antibody binding mutational database for computational affinity predictions. Protein Sci. 25, 393–409 (2016). source
  • Probably not a substantial claim.

    Premisecitation

    The SKEMPI dataset contains 2,317 single point mutation data entries (SKEMPI S2317 set).

    “There are 2,317 single point mutation data entries among the whole database, which are referred to as the SKEMPI S2317 set.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [11] Moal, I. H. & Fernández-Recio, J. SKEMPI: a structural kinetic and energetic database of mutant protein interactions and its use in empirical models. Bioinformatics 28, 2600–2607 (2012). source
  • Probably not a substantial claim.

    Premisecitation

    SKEMPI 2.0 contains 7,085 entries, including single- and multi-point mutations.

    “This dataset contains 7,085 entries, including single- and multi-point mutations.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [39] Jankauskaitė, J., Jiménez-García, B., Dapkūnas, J., Fernández-Recio, J. & Moal, I. H. SKEMPI 2.0: an updated benchmark of changes in protein–protein binding energy, kinetics and thermodynamics upon mutation. Bioinformatics 35, 462–469 (2018). source
  • Probably not a substantial claim. The paper’s conclusions may not depend on it.

    Premisecitation

    Pires et al. found that excluding non-binders from the dataset would significantly increase the performance of a prediction model.

    “Pires et al.21 found that excluding non-binders from the dataset would significantly increase the performance of a prediction model.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites Pires et al.21 Pires, D. E. & Ascher, D. B. mCSM-AB: a web server for predicting antibody–antigen affinity changes upon mutation with graph-based signatures. Nucleic Acids Res. 44, W469–W473 (2016). source
  • Probably not a substantial claim. The paper’s conclusions may not depend on it.

    Premisecitation

    SKEMPI contains 3,047 mutation data entries for protein-protein heterodimeric complexes with experimentally determined structures.

    “SKEMPI is a more general database for protein–protein binding affinity changes following mutation (ΔΔG)11, it contains 3,047 mutation data entries for protein–protein heterodimeric complexes with experimentally determined structures.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [11] Moal, I. H. & Fernández-Recio, J. SKEMPI: a structural kinetic and energetic database of mutant protein interactions and its use in empirical models. Bioinformatics 28, 2600–2607 (2012). source
  • Probably not a substantial claim. It may be too vague to check against evidence.

    Interpretationreasoning

    The limited performance of current methods highlights a pressing need for a new generation of ΔΔG predictors constructed with entirely new design principles and/or innovative machine learning algorithms.

    “The limited performance of the current methods therefore highlights a pressing need for a new generation of ΔΔG predictors that are constructed with entirely new design principles and/or innovative machine learning algorithms.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim. The paper’s conclusions may not depend on it.

    Interpretationreasoning

    A possible reason for the positive energy change of mutations to alanine is that mutations from a large residue to a small one could lead to a stabilizing effect on the whole system.

    “a possible reason is that mutations from a large residue to a small one could lead to a stabilizing effect to the whole system”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim. It may state two separate claims as one.

    Premisecitation

    Persistent homology is able to bridge geometry and topology, leading to a new efficient approach for the simplification of biological structural complexity.

    “Persistent homology22–25—a new branch of algebraic topology—is able to bridge geometry and topology, leading to a new efficient approach for the simplification of biological structural complexity26–31; however, it neglects critical chemical/biological information when it is directly applied to complex biomolecular structures.”
    Quote in the paperSubstantial claim0 of 10 sources checked
    • cites [22] Frosini, P. & Landi, C. Size theory as a topological tool for computer vision. Pattern Recognition Image Anal. 9, 596–603 (1999).
    • cites [23] Edelsbrunner, H., Letscher, D. & Zomorodian, A. Topological persistence and simplification. Discrete Comput. Geom. 28, 511–533 (2002). source
    • cites [24] Zomorodian, A. & Carlsson, G. Computing persistent homology. Discrete Comput. Geom. 33, 249–274 (2005). source
    • cites [25] Zomorodian, A. & Carlsson, G. Localized homology. Comput. Geom. 41, 126–148 (2008). source
    • cites [26] Xia, K. L. & Wei, G. W. Persistent homology analysis of protein structure, flexibility and folding. Int. J. Numer. Methods Biomed. Eng. 30, 814–844 (2014). source
    • cites [27] Gameiro, M. et al. Topological measurement of protein compressibility via persistence diagrams. Japan J. Industr. Appl. Math. 32, 1–17 (2014).
    • cites [28] Xia, K. L. & Wei, G. W. Persistent topology for cryo-EM data analysis. Int. J. Numer. Methods Biomed. Eng. 31, e02719 (2015).
    • cites [29] Cang, Z. X. et al. A topological approach to protein classification. Mol. Based Math. Biol. 3, 140–162 (2015).
    • cites [30] Yao, Y. et al. Topological methods for exploring low-density states in biomolecular folding pathways. J. Chem. Phys. 130, 04B614 (2009).
    • cites [31] Kovacev-Nikolic, V., Bubenik, P., Nikolić, D. & Heo, G. Using persistent homology and dynamical distances to analyze protein binding. Stat. Appl. Genet. Mol. Biol. 15, 19–38 (2016). source
  • It may state two separate claims as one.

    Interpretationnone given

    The non-binders in the AB-Bind dataset can be regarded as outliers and have a strongly negative impact on prediction model accuracy.

    “These non-binders could be regarded as outliers in the database and have a strongly negative impact on the prediction model accuracy.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim. The paper’s conclusions may not depend on it.

    Interpretationreasoning

    A possible reason for the observed patterns of energy change across mutation regions is that different mutation regions vary in their accessibility to water.

    “A possible reason for these patterns is that different mutation regions vary in their accessibility to water”
    Quote in the paperNot a substantial claim
    • Rests on an assumption: In general, surface, interior and rim regions have greater access to water than the core and support regions.
  • Probably not a substantial claim. The paper’s conclusions may not depend on it.

    Premisecitation

    Similar patterns regarding mutation sites and energy changes were reported in the literature.

    “Similar patterns regarding mutation sites and energy changes were reported in the literature49.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [49] Petukh, M., Li, M. & Alexov, E. Predicting binding free energy change caused by point mutations with knowledge-modified MM/PBSA method. PLoS Comput. Biol. 11, e1004276 (2015). source
  • Probably not a substantial claim. The quote only partly states this claim.

    Study design and conductcitation

    For sets S4169 and S8338, tenfold stratified cross-validation was used following the mCSM-PPI2 paper.

    “We followed the method of tenfold stratified cross-validation used in mCSM-PPI2 paper for sets S4169 and S833848.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [48] Rodrigues, C. H. M., Myung, Y., Pires, D. E. V. & Ascher, D. B. mCSM-PPI2: Predicting the effects of mutations on protein–protein interactions. Nucleic Acids Res. 47, W338– W344 (2019). source
  • Probably not a substantial claim. The quote only partly states this claim.

    Study design and conductown data

    The performance on the SKEMPI S1131 set was assessed using tenfold cross-validation.

    “Table 2 shows the Pearson correlation coefficients on tenfold cross-validations.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim.

    Premisecitation

    David et al. selected 4,169 variants in 319 different complexes (S4169) from SKEMPI2 by filtering only single-point mutations.

    “They filtered only single-point mutations and selected 4,169 variants in 319 different complexes (denoted set S4169).”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [48] Rodrigues, C. H. M., Myung, Y., Pires, D. E. V. & Ascher, D. B. mCSM-PPI2: Predicting the effects of mutations on protein–protein interactions. Nucleic Acids Res. 47, W338– W344 (2019). source
  • Probably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.

    Premisenone given

    Physics-based methods provide mechanistic interpretations but are not designed for handling large and diverse datasets.

    “Typically, physics-based methods provide mechanistic interpretations but are not designed for handling large and diverse datasets.”
    Quote in the paperNot a substantial claim
  • It may state two separate claims as one.

    Interpretationown data

    The relative inferior performance for surface mutations is due to its small data size and the small average energy disturbance caused by surface mutations.

    “We believe that the relative inferior performance for surface mutations is due to its small data size and that the energy disturbance caused by surface mutations is small on average.”
    Quote in the paperSubstantial claim
  • It may state two separate claims as one.

    Interpretationown data

    Models trained on some protein families could extrapolate to other families, with the best families 1KTZ and 2JEL reaching RP of 0.866 and 0.818 and the poorest families 1FFW and 1YY9 having RP of −0.043 and −0.068.

    “Models trained on some protein families could extrapolate to other families; for example, the two protein families with the best results, 1KTZ and 2JEL, can reach RP of 0.866 and 0.818, respectively, whereas the two families with the poorest results, 1FFW and 1YY9, have RP values of −0.043 and −0.068, respectively.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim.

    Premisecitation

    Topology has recently been shown to be surprisingly effective in simplifying biomolecular structural complexity.

    “Topology has recently been shown to be surprisingly effective in simplifying biomolecular structural complexity26,27,29.”
    Quote in the paperSubstantial claim0 of 3 sources checked
    • cites [26] Xia, K. L. & Wei, G. W. Persistent homology analysis of protein structure, flexibility and folding. Int. J. Numer. Methods Biomed. Eng. 30, 814–844 (2014). source
    • cites [27] Gameiro, M. et al. Topological measurement of protein compressibility via persistence diagrams. Japan J. Industr. Appl. Math. 32, 1–17 (2014).
    • cites [29] Cang, Z. X. et al. A topological approach to protein classification. Mol. Based Math. Biol. 3, 140–162 (2015).
  • Probably not a substantial claim. The paper’s conclusions may not depend on it.

    Premisecitation

    Topology has been devised to win worldwide competitions in computer-aided drug design.

    “It has been devised to win worldwide competitions in computer-aided drug design36.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [36] Nguyen, D. D. et al. Mathematical deep learning for pose and binding affinity prediction and ranking in D3R grand challenges. J. Compurt. Aided Mol. Design https://doi.org/10.1007/s10822-018-0146-6 (2018). source
29 of 29
  • The authors state this as an assumption.

    The individual learners in an ensemble are likely to make different mistakes, so summing weak learners reduces overall error.

    “It improves the performance on the weak learners with the assumption that the individual learners are likely to make different mistakes and thus summing the weak learners will reduce the overall error.”
  • The paper relies on this without support.

    PPI ΔΔG prediction data are highly complex due to 3D structures, whereas the datasets are relatively small.

    “A major challenge in the prediction of binding affinity changes following mutation for PPIs is that the data is highly complex due to 3D structures, whereas the datasets are relatively small.”
  • The paper relies on this without support.

    In general, surface, interior and rim regions have greater access to water than the core and support regions.

    “in general, surface, interior and rim regions have greater access to water than the core and support regions.”
3 of 3

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?

  • TopGBT uses topology-based features not initially designed for representing interactions between atoms, limiting its predictive power for binding affinity changes upon mutations.

    “TopGBT uses topology-based features to represent the complex, which is not initially designed for representing the interactions between atoms, limiting its predictive power for binding affinity changes upon mutations.”
  • Some complexes in the benchmark datasets are highly related, so machine learning methods tend to be overtrained on these datasets, as evidenced by drops in prediction performance when meeting unseen structures.

    “As some complexes in the above benchmark datasets are highly related (S2 and S3 Figs), machine learning methods tend to be overtrained on these datasets, as evidenced by the drops of the prediction performance when machine learning methods meet unseen structures [31].”
  • The six benchmark datasets have been widely used to test the predictive power of PPI prediction methods.

    “These datasets have been widely used to test the predictive power of the PPI prediction methods [12, 13, 27–29, 29–35].”

Self-check

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

Each contradiction between two passages listed here was confirmed by an independent check.

  • The same 645 AB-Bind mutations are assigned to different numbers of complexes

    Minor

    The paper first says the 645 single-point mutations are on 32 antibody-antigen complexes, then says it considers 645 single mutations across 29 complexes. It does not explain a change in the number of mutations that would account for the different complex counts.

1 of 1

Citations

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Metadata

Authors
Wang, M., Cang, Z., & Wei, G.-W.
Affiliations
Michigan State University (US)
Corresponding author
Wei, Guo-Wei
Venue
Nature Machine Intelligence
Published
2020-02-14
Volume
2
Issue
2
Pages
116-123
ISSN
2522-5839 (ISSN-L)
OpenAlex
W3005822506
Cited by
202
References
54
Citations by year
2026: 19 · 2025: 41 · 2024: 39 · 2023: 41 · 2022: 32 · 2021: 22 · 2020: 7
FWCI
8.27
Type
journal article
Language
en
Open access
Locations
  • Nature Machine Intelligence (publishedVersion)
  • PubMed Central (publishedVersion)
  • PubMed (publishedVersion)
Funders
  • National Science Foundation (DMS-1721024, DMS 1761320, DMS-1761320, IIS1900473)
  • U.S. Department of Health & Human Services | NIH | National Institute of General Medical Sciences (GM126189)
  • Bristol-Myers Squibb
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Machine Learning in Bioinformatics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
  • Life Sciences › Pharmacology, Toxicology and Pharmaceutics › Drug Discovery › Computational Drug Discovery Methods
Keywords
protein-protein interaction, ΔΔG, mutation effects, persistent homology, algebraic topology, protein-protein complex, convolutional neural networks, gradient boosting decision tree, topological invariants

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.

A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

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