BiologybioRxiv

Ranked by formulaVerdict: Notable

BenchMHC: a reproducible framework for peptide-MHC presentation prediction

Predicting which peptides an MHC molecule presents is the first step in neoantigen and epitope discovery pipelines.

By Borck, Chabrol, Colombo +5

Score████░░░░░░4.4

Key numbers

  • 350 times faster than the original
  • 99% of hits are found
  • 12% of their decoys

Caveats

  • Preprint; not yet peer reviewed.

VerdictWorth a reader's time today.

Read the originalPDF

Abstract

Predicting which peptides an MHC molecule presents is the first step in neoantigen and epitope discovery pipelines. Most published predictors are released for inference only, and each is trained on a different dataset, so the effect of a new method cannot be separated from the effect of its training data. We present BenchMHC, an open framework that reproduces, retrains and evaluates pMHC presentation models on public data only, and that records every implementation decision made in a reproduction. Our NetMHCpan-4.1 reproduction reaches 0.794 per-allele Mean Top-K against 0.790 for the official webserver, and 0.0025 Median FRANK against 0.0022. It scores 280,000 peptide/allele pairs in 27 s, about 350 times faster than the original binary. We then examine the training data. In the public NetMHCpan-4.1 eluted-ligand sets, 86 to 99% of hits are found in the human proteome, against about 12% of their decoys, so a model can separate hits from decoys using this difference rather than features related to MHC binding. Redrawing the decoys within the source protein of each hit and matching their cysteine status, with no other change, raises per-allele Mean Top-K on the regenerated v2.0.0 evaluation set from 0.734 to 0.755, and increases Median FRANK on CD8 epitopes from 0.0025 to 0.0053. The same change improves one evaluation set and degrades the other. Code (Apache-2.0) and model checkpoints (CC BY-NC-4.0): https://github.com/instadeepai/BenchMHC-public.

T. Borck, M. Chabrol, D. Colombo, A. Imbert, M. Perier-Dulhoste, K. Volzhenin, M. Lang, S. N. Lopez Carranza

The editor's rubric

Heuristic review

Leverage3 / 5
A method or resource many groups across the field will adopt within a year.
24% of this desk’s rubric
Magnitude3 / 5
Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
16% of this desk’s rubric
Evidence3 / 5
Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
20% of this desk’s rubric
Novelty3 / 5
A genuinely new approach to an open problem.
20% of this desk’s rubric
Trajectory2 / 5
Some room to improve with obvious engineering.
10% of this desk’s rubric
Stakes2 / 5
Benefits a professional community (practitioners, clinicians, engineers).
10% of this desk’s rubric

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose, new method); gains (x-fold); novelty (alternative to status quo, discovery); verification (independent replication, code released); scale (efficient).

How the score was computed

rank-2026-10-18

Score████░░░░░░4.4

Score = 10 × (75% × adjusted merit / 10 + 15% × attention + 10% × freshness)

Desks place stronger verdicts first, then use this score to order work within the same verdict.

Merit
5.6 / 10
Weighted rubric, evidence-gated.
Adjusted merit
4.7 / 10
Shrunk toward the desk prior by editor confidence (44%).
Attention
0%
Citations, upvotes, points, mentions.
Freshness
88%
Half-life decay since publication.

No attention signals recorded yet.

The record

  • Reviewed by heuristic-v10 on Oct 28, 2026, 05:48 UTC. Paper type: method.
  • Categories: bioinformatics
  • BRIEF, No.1 in the Biology edition of October 28, 2026.