Cryptic binding sites are detected but not ranked: coverage, conversion, and the limits of detector consensus
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 tools 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 fields headroom is therefore predominantly in ranking and in combination, not in detection: perfect ranking of a single tools 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.
02 /Specification & Classification
Click any tag to browse matching papersReproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Lacuna: Cryptic Binding Pocket Discovery via Conformational Ensemble Analysis
Clayton W. Moore·bioRxiv·Sep 17, 2026
- Ability of a Structural World Model to Detect Cryptic Pockets from Apo Structure
Ryan Shihabi, Brent Vaughan, Sharief Taraman·bioRxiv·Sep 24, 2026
- CryptoBench: Cryptic protein-ligand binding sites dataset and benchmark
Vít Škrhák, Marián Novotný, … David Hoksza·BioinformaticsPeer-reviewed·Dec 16, 2024
- Kryptix-1: Conformational Ensemble Sampling Substantially Improves Cryptic Pocket Detection Relative to Static-Structure and Prior Computational Approaches
Ryan Varghese, Pooja Tiwary, Krishil Oswal·bioRxiv·Sep 24, 2026
- CryptoBank: A Resource for the Identification and Prediction of Cryptic Sites in Proteins
Pedro Febrer Martinez, Thorben Fröhlking, … Francesco Luigi Gervasio·Science AdvancesPeer-reviewed·Apr 22, 2026
- CrypToth: Cryptic pocket detection through mixed-solvent molecular dynamics simulations based topological data analysis
Jun Koseki, Chie Motono, … Kenichiro Imai·Journal of Chemical Information and ModelingPeer-reviewed·May 22, 2025