~/aixsci
weekly updates

structural-biology/ai produced the result/iScience 2026 · v2

AI model trained on protein folding predicts how mutations affect binding

Researchers developed a neural network trained on how proteins fold to predict how mutations affect protein-protein binding. They used it to design variants of a viral protein and tested them in the lab.

1. Curate and filter mutation affinity datasets2. Encode complexes as geometric graphs3. Pre-train on inverse protein folding4. Transfer-learn affinity predictor5. Predict ln(KD) and ΔΔG for mutants6. Read residue-level attention scores7. Screen multi-site mutation combinations8. Express variants and measure binding

spectrum · one line per step, placed by what the step does · bright lines used AI

An inverse-protein-folding pre-trained model for predicting the mutational effects in protein-protein interactions
iScience, 2026

doi:10.1016/j.isci.2026.117693 · record aix-00275 v2 · checked 2026-10-23

ai-resultrole of AI
AI was for
Property prediction
Model family
Graph neural network, Multilayer perceptron
Checked by
Experimental9 tested
Code
available

The finding the paper is about came from the AI.

read as

The science is explained before the AI appears. Switch to field specialist to go straight to the method.

Assumes the discipline and goes straight to the method.

The diagram, the record and what the paper did not report are identical in both modes. Only the framing changes, never the evidence.

Introduction by AIxSci · plain language

What this research was about

Proteins bind to each other at specific molecular interfaces. A single change to an amino acid at these interfaces can strengthen or weaken the interaction, or destroy it entirely. Predicting which mutations will have what effect requires understanding how amino acid substitutions alter the precise fit and chemical interactions between proteins. This is difficult because binding depends on the three-dimensional structure of the interface, and even small structural changes can have large effects. Computational approaches typically require time-consuming structure prediction or molecular simulations.

The researchers set out to develop a machine-learning model that could predict how mutations affect binding affinity. Rather than rely on time-consuming simulations or experiments, they trained a neural network on existing datasets of mutant proteins and their measured binding strengths. They then validated their approach by designing new protein variants computationally and testing the predictions in the laboratory.

Where AI came in

The AI was a neural network that represented proteins as networks of amino acids connected by their three-dimensional distances. It was initially trained on a large database of natural protein structures, learning to predict the identity of amino acids from how the rest of the protein was arranged. This pre-training taught the model key principles of protein architecture. The model was then adapted for the task of predicting how mutations change binding affinity, using an attention mechanism that identified which amino acids were most important for the interaction.

Rather than experimentally measure each protein variant or rely on conventional computational methods, the neural network could rapidly score mutations. The researchers used it to search through millions of possible amino acid combinations in a viral protein's receptor binding domain, screening far more variants than would be feasible with traditional approaches. Nine candidates were selected by the model for synthesis and testing. Experimental validation confirmed that the neural network accurately predicted binding affinity changes.

Written by AIxSci from the checked record below, to give context for readers outside the field. It is not part of the record.

The work

Technical · from the record

DGMPNN is a message-passing graph neural network that was pre-trained on an inverse-protein-folding task over PDB protein assemblies and then transfer-learned, with an attention-based graph pooling readout, to predict ln(KD) for two-chain protein complexes, from which ΔΔG between a mutant and the wild type is computed. Under three repeats of 10-fold cross-validation the text reports average Pearson correlations of 0.875 on S1131 and 0.790 on S4169 for ΔΔG, and the model was compared with energy-based and earlier machine-learning predictors including FoldX. A version trained on SARS-CoV-2 BA.1 RBD deep mutational scanning data was then used to score multi-site mutation combinations across the receptor binding motif, and nine selected variants were expressed and assayed; across the six variants that behaved as monomers, predicted and BLI-derived ΔΔG gave a Spearman coefficient of 0.886 and a Pearson coefficient of 0.726.

How AI was used

Protein complexes were converted into directed residue graphs whose edges encode Euclidean distances across 25 backbone and idealised Cβ atom pairs, expanded with 16 Gaussian kernels, plus one-hot relative sequence positions and an intra- versus inter-chain flag, with node features initialised to zeros. A three-layer encoder and three-layer decoder message-passing network, operating over the 48 nearest neighbours by Cα-Cα distance, was pre-trained autoregressively on PDB assemblies deposited as of 2 August 2021 and clustered at 30% identity, recovering masked native residue identities under a teacher-forcing schedule with homologous chains masked. For the downstream task, an additional encoder layer produced multi-head residue-level attention scores conditioned on encoder edge features and decoder node features; the reweighted node features were summed, concatenated with global pooling, and passed to a two-layer MLP trained with mean squared error against experimental ln(KD) from SKEMPI-derived and DMS-derived datasets, with pooling and readout parameters initialised from a Xavier uniform distribution. Evaluation used 10-fold cross-validation, leave-one-complex-out splits, a pre-training set purged of 1R0R homologues, and an external set of published affinity measurements. The fine-tuned model was then run over enumerated multi-site mutation combinations in 21 five-residue patches of the BA.1 receptor binding motif and over a rule-filtered combinatorial library, retaining variants whose predicted ΔG did not exceed that of the wild type; attention scores were also inspected to locate residues contributing to the interface, and nine model-selected variants were taken forward to recombinant expression, BLI and ELISA.

The shape of the work

Structural · the record, drawn

PREPARATIONREPRESENTATIONTRAININGTRAININGINFERENCEINTERPRETATIONSCREENINGEXPERIMENT12345678AIAIAIAIAICurate and filtermutation affinitydatasetsEncode complexesas geometricgraphsPre-train oninverse proteinfoldingTransfer-learnaffinitypredictorPredict ln(KD)and ΔΔG formutantsReadresidue-levelattention scoresScreen multi-sitemutationcombinationsExpress variantsand measurebinding↤ physical experiment↤ expert judgement↤ conventional algorithm
AI stepNo AI↤ what the AI stood in for

Curate and filter mutation affinity datasets

Cleaning, filtering, normalising or labelling data already obtained.

a subset of 2462 mutants each with a single point mutation on the 205 unique protein complexes were selected, namely S2462where the paper describes this · verbatim
in the paper

Encode complexes as geometric graphs

Encoding data into features, descriptors, embeddings or graphs.

The geometric features of protein complexes were captured by encoding the Euclidean distances between atom pairs across residues.where the paper describes this · verbatim
in the paper

Pre-train on inverse protein folding

Fitting model parameters, including fine-tuning an existing model.

An autoregressive inverse protein folding task was performed on these protein complex data.where the paper describes this · verbatim
in the paper

Transfer-learn affinity predictor

Fitting model parameters, including fine-tuning an existing model.

Transfer learning is subsequently performed for mutational effect prediction through a residue-level attention-based graph pooling mechanismwhere the paper describes this · verbatim
in the paper

Predict ln(KD) and ΔΔG for mutants

Running a trained model over new data to predict, classify or score. The AI stood in for physical experiment.

Our model gave prediction of ln(KD) directly.where the paper describes this · verbatim
in the paper

Read residue-level attention scores

Extracting understanding from model behaviour. The AI stood in for expert judgement.

we can obtain residue-specific attention scores to evaluate the contribution of each node (residue) to the PPIswhere the paper describes this · verbatim
in the paper

Screen multi-site mutation combinations

Reducing a candidate set by filtering or ranking, in a single pass. The AI stood in for conventional algorithm.

Extensive exploration of 3,200,000 (20) possible combinations was performed on each patch.where the paper describes this · verbatim
in the paper

Express variants and measure binding

Physical execution, by hand or by robot.

RBD-ACE2 interactions were measured using an Octet RED384 systemwhere the paper describes this · verbatim
in the paper

What the record says

Technical · every part carries its own basis

+ in the paper~ our reading− not reported

How to read the quotations. A quotation shows where the paper describes something. It does not quote every value beside it: one passage locates a part of the work, and values without their own quotation are our reading of that passage.

~Role of AI
AI produced the resultour reading

The multi-site variants that were expressed and assayed were chosen by scoring with the model, and the reported ΔΔG agreements are between model predictions and measurements, so the central claims rest on the model's output.

+What the AI was for
DGMPNN is pre-trained on an inverse protein folding (IPF) task and employs an adaptive residue-level attention pooling mechanismwhere the paper describes this · verbatim
+How results were checked
Experimental9 testedin the paper
We randomly picked 9 BA.1 RBD variants from the library with varied number of mutationswhere the paper describes this · verbatim
+Code · weights · data
code availableweights not reporteddata availablein the paper
This paper reports original custom code. The code is available from the code repositorywhere the paper describes this · verbatim
+Compute
Pre-training and the patch-based exploration were each run on a single NVIDIA RTX 4090 GPU; the patch calculation completed in ~21 days, under 0.025 s per variant on averagein the paper

What this paper did not report

Technical · absence is published deliberately

Reported as not stated: 5 items
  • Trained model weightsWhether the trained model is available is not stated.
  • Version of DGMPNNWhich version of the model was used is not stated.
  • Version of AlphaFold3Which version of the model was used is not stated.
  • What step 3 replacedThe paper gives no basis for what the AI stood in for.
  • What step 4 replacedThe paper gives no basis for what the AI stood in for.

About this article

Record aix-00275, version 2, checked by a person on 2026-10-23. The record describes the paper; it does not assess whether the paper's findings are right. The paper is published under CC-BY; quotations are at most 25 words. How we work · Report an error

Cite this record: AIxSci (2026). AI model trained on protein folding predicts how mutations affect binding. Record aix-00275, version 2, checked 2026-10-23. https://aixsci.org/articles/aix-00275/