Skip to content

Cryptic binding sites are detected but not ranked: coverage, conversion, and detector consensus

Aug 2026 · bioRxiv · 0 citations
Biology

TL;DR

Pockets from a protein language model at locations where geometry finds no concavity improves single-structure recovery by 8.5% (95% CI +4.0 to +13.6) on test-fold data, and lets a five-conformer ensemble match a twenty-conformer one at a third of the wall clock.

Abstract

Methods for predicting cryptic binding sites are compared almost exclusively on top-n recovery, a number that conflates two independent abilities: proposing a candidate at the right location, and ranking it highly enough to be seen. We separate them by retaining the per-candidate overlap of every proposal, rather than only the top five, for four structurally different detectors spanning 2009 to 2026, across the CryptoBench benchmark. The separation is large and it reorders the field. On the designated test fold of 178 structures, fpocket, a purely geometric method from 2009, proposes a qualifying candidate for 74.2% of targets, the highest coverage of any tool tested, yet surfaces one in its top five for only 43.8%. P2Rank proposes qualifying candidates for 66.3% and surfaces 63.5%, and IF-SitePred, a 2024 method built on protein language model embeddings, proposes 70.8% and surfaces 61.8%. Coverage across tools varies by 8 points while conversion, the share of a tool’s own coverage that reaches the top five, varies from 59% to 96%. Unioning the four detectors reaches 92.1% coverage, and only 7.9% of cryptic sites are invisible to all of them. The field’s headroom is therefore predominantly in ranking and in combination, not in detection: perfect ranking of a single tool’s existing proposals would reach 74.2%, and of the union 92.1%, against the 66.3% currently achieved. We show the practical consequence is governed by candidate budget. Added coverage converts to recovery at about 85% while a structure carries fewer than roughly fifteen candidates and at about 51% above it, which explains a series of interventions that raised coverage and returned nothing. Working within that budget, proposing pockets from a protein language model at locations where geometry finds no concavity improves single-structure recovery by 8.5% (95% CI +4.0 to +13.6) on test-fold data, and lets a five-conformer ensemble match a twenty-conformer one at a third of the wall clock. We release per-candidate overlaps for all tools so that coverage and conversion can be reported separately without re-running any method.

View source

Similar papers

Open access Aug 2026

Lacuna: Cryptic Binding Pocket Discovery via Conformational Ensemble Analysis

Lacuna, an open-source Python tool for discovering cryptic binding pockets, generates a conformational ensemble from any input structure, detects pockets independently in every conformer, clusters the detections into persistent sites across the ensemble, and ranks those sites with a model fitted on within-structure pairs.

Clayton W. Moore · 0 citations
Preprint Aug 2026

The Embedder's Dilemma: LLMs Are Better, but at What Cost?

These results support a division of labour: use embedding models for similarity, classification, and clustering, and reserve LLMs for reasoning-intensive retrieval, and reserve LLMs for reasoning-intensive retrieval.

Adnan El Assadi, Niklas Muennighoff, Jinhyuk Lee · 1 citation
Open access Aug 2026

Nesso-1: Accelerating Open-Source Binding Affinity Predictions

Novo-1, a coarse-grained cofolding framework for binding- affinity prediction, offers more than one order of magnitude speed-up over the leading open-source baseline, Boltz-2, and demonstrates meaningful selectivity, separating the binding affinities of identical compounds between on-targets and related off-targets.

Nikhil Shenoy, David Errington, Emmanuel Bengio et al. · 0 citations
Open access Aug 2026

Measuring and removing near-duplicate contamination in alignment-free SARS-CoV-2 lineage classification benchmarks

Alignment-free lineage assignment from k-mer frequency profiles is widely used for SARS-CoV-2 surveillance, and the methods that do it are ranked against each other by margins of one or two percentage points. Those rankings rest on an unchecked protocol. Public repositories hold many near-duplicate genomes, and stratified random splitting puts members of such a group on both sides of the split, so a classifier is credited for sequences it has already seen. We propose quantised profile hashing, which finds near duplicates in k-mer feature space by rounding each frequency vector and hashing it. No sequence is compared with any other, so one pass over the feature matrix suffices and no similarity threshold has to be chosen. Rounding is also what makes the groups well defined, and they are then kept whole across the training, validation and test sets. On 255,611 genomes from seven Pango lineages, random splitting leaves 5.09% of test sequences with a near duplicate in training, on a benchmark ranked by margins of one or two points. Ten update rules were trained twice, identically except for the partition. The contaminated benchmark separates one rule from the leader at 0.05; the clean one separates none. The two orderings are uncorrelated, Kendall τ = +0.022, with rules moving 3.2 positions on average and the leader of one benchmark ranking eighth on the other. A ranking obtained under contamination therefore says nothing about the ranking without it, and the quantity worth reporting beside a score is the leakage rate of the split.

Mohammad Jamhuri, A. Irawan · 0 citations
Book Open access Jun 2026

UniPocket: Unified Ligand and Cryptic Pocket Prediction from Protein Language Model Embeddings

UniPocket is presented, a unified multitask framework for residue-level prediction of both ligand-binding and cryptic-pocket residues within a single shared-backbone architecture and achieves a macro ROC-AUC of 0.76.

Lening Zhao, Tianhua Zhai, Li Shen · 0 citations

Related blog posts

MIT News · Artificial Intelligence Aug 27, 2026

Looking beyond natural sequences

A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.

Google DeepMind Blog Nov 25, 2025

AlphaFold: Five years of impact

Explore how AlphaFold has accelerated science and fueled a global wave of biological discovery.