Rank-guided learning plus robotics reprogram two enzymes 57-fold and 104-fold in five cycles

2026-08-05

REAP couples a ranking-plus-regression loss on protein-language-model features with a robotic closed loop, lifting P450 BM3 activity 57-fold and Sortase A 104-fold in five cycles.

What problem this solves

Directed evolution (iterating mutation and screening until an enzyme does what you want) has two chronic problems. First, the fitness landscape (the high-dimensional surface mapping each variant to its activity) is rugged and sparse: a round screens thousands of mostly-dead variants, and the mutations that actually help often sit far from the catalytic center, so active-site-focused search misses them. Second, pure wet-lab work is slow (a cycle takes weeks), while predictive models trained on the few measurements you have struggle under standard regression losses, which care about absolute values when, with sparse data, getting the ranking right matters more.

Method

REAP bolts three things into one loop: a protein language model for features, a hybrid loss called RankReg, and a fully automated wet-lab robot.

The model:

The robot is a four-stage pipeline: library construction (3 days), protein expression (2 days), lysis and reaction (1 day), functional assay (1 hour), all on a Tecan Fluent with no human in the loop. P450 BM3 products are quantified by Echo-MS; Sortase A by fluorescence dequenching. Pairwise Pearson correlations across 12 replicate runs exceed 0.98, and crude-lysate activity correlates with purified-protein activity at R≈0.96, so the high-throughput numbers are trustworthy.

Each round retrains the model, and the next round's suggestions climb from single mutations to combinatorial ones.

Results

P450 BM3 (a cytochrome P450 engineered here to hydroxylate (−)-deoxypodophyllotoxin, a precursor to the anticancer lignan podophyllotoxin):

Sortase A (a Staphylococcus aureus transpeptidase used for protein conjugation):

Model benchmarks (five-fold cross-validation, Spearman correlation for ranking):

loss/modelrankingsingle-to-combinatorial extrapolation
PLM-RankRegbaselinebaseline
EVOLVEprosignificantly worse (P=3.6×10⁻⁶)significantly worse (P=1.4×10⁻⁴)
MSE / L1significantly worsesignificantly worse
HuberLossworse (ranking)not significant (P=0.076)

It leads across the board on ranking. On extrapolation to combinatorial space, the edge over HuberLoss is not significant.

Why it matters

Ranking learning, caring about relative order rather than absolute value, is a mature idea in recommender systems, and it lands well on the sparse-data reality of directed evolution. Paired with automation, REAP compresses an engineering cycle to weeks and makes the model stronger each round. For anyone in synthetic biology or green chemistry (replacing metal catalysts with enzymes to make drug molecules), it is a working example of AI wired into the experiment itself rather than stopping at prediction.

Limitations

Terms

Source

What people are saying

All paper explainers