Skip to content
Open access

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

Aug 2026 · bioRxiv · 0 citations · 2 references
Biology

TL;DR

Injecting synthetic competitors drawn from each target’s own wrong-answer score distribution, holding the true site, candidate pool and ranker fixed, reduced top-five recovery by 16.8 points on training folds and 17.0 points on the held-out test fold.

Abstract

Cryptic-pocket prediction is compared almost entirely by top-n recovery, which conflates two separable abilities: proposing a candidate at the true site, and ranking it highly enough to be seen. We retained per-candidate overlaps for five candidate-generation methods, evaluated in six configurations, on the CryptoBench test fold. Coverage spanned 14.5 points; conversion of coverage into top-five recovery spanned 36.7. Two rankers over an identical candidate set differed by 10.6 recovery points at equal coverage, isolating ranking exactly. Union coverage saturated at 92.2%, reaching 98.6% on sites of at least eight residues, with residual failures concentrated on small sites. Injecting synthetic competitors drawn from each target’s own wrong-answer score distribution, holding the true site, candidate pool and ranker fixed, reduced top-five recovery by 16.8 points on training folds and 17.0 points on the held-out test fold. Pooling detectors consequently gains nothing at a budget of five and 11.8 points at twenty.

Read PDF

Similar papers

Open access Sep 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 pai...

Clayton W. Moore · 1 citation · ⚡1
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. · 3 citations · ⚡1
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 stratif...

Mohammad Jamhuri, A. Irawan · 0 citations
Jul 2026

Identifying Cryptic Binding Sites with Mixed Solvent MD Simulation and SiteMap

A novel "induce-and-identify" workflow that integrates mixed solvent molecular dynamics simulations with SiteMap is developed and validated, enabling the exploration of a broader range of druggable targets by effectively inducing and identifying cryptic binding sites.

Da Shi, Dmitry Lupyan, Steven V. Jerome et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.