Evidence map›Paper›PMID 40098262›Full record

ArticleProtein engineering, design & selection : PEDS2025

Tuning ProteinMPNN to reduce protein visibility via MHC Class I through direct preference optimization.

Hans-Christof Gasser, Diego A Oyarzún, Javier Antonio Alfaro, Ajitha Rajan

Abstract read
In one paragraph

Article in Protein engineering, design & selection : PEDS, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

5 citing papers in PubMed.

  1. Review
  2. Limitations of the refolding pipeline for de novo protein design.Protein science : a publication of the Protein Society · 2026
    Article
  3. Review
  4. Article
  5. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Hans-Christof GasserSchool of Informatics, University of Edinburgh, Edinburgh, EH8 9AB, United Kingdom.ORCID 0000-0003-1274-4966
Diego A OyarzúnSchool of Informatics, University of Edinburgh, Edinburgh, EH8 9AB, United Kingdom.ORCID 0000-0002-0381-5278
Javier Antonio AlfaroSchool of Informatics, University of Edinburgh, Edinburgh, EH8 9AB, United Kingdom.ORCID 0000-0002-5553-6991
Ajitha RajanSchool of Informatics, University of Edinburgh, Edinburgh, EH8 9AB, United Kingdom.ORCID 0000-0003-3765-3075

Funding

UKRI Centre for Doctoral Training in Biomedical AI at the University of Edinburgh, School of InformaticsUnited Kingdom Research and Innovation EP/S02431X/1
6 · The paper itself

Abstract

ProteinMPNN is widely used in protein design workflows due to its ability to identify amino acid sequences that fold into specific 3D protein structures. In our work, we adjust ProteinMPNN to design proteins for a given 3D protein structure with reduced immune-visibility to cytotoxic T lymphocytes that recognize proteins via the MHC-I pathway. To achieve this, we developed a novel framework that integrates direct preference optimization (DPO)-a tuning method originally designed for large language models-with MHC-I peptide presentation predictions. This approach fosters the generation of designs with fewer MHC-I epitopes while preserving the protein's original structure. Our results demonstrate that DPO effectively reduces MHC-I visibility without compromising the structural integrity of the proteins.

Indexed as

Histocompatibility Antigens Class IProtein EngineeringProteinsAmino Acid SequenceHumansModels, MolecularProtein ConformationHistocompatibility Antigens Class IProteinsdirect preference optimizationMHC Class Iprotein deimmunizationprotein designProteinMPNN

Identifiers

PMID40098262
PMCPMC11970896

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.