Skip to content
DraconiticResearch
Search Sources API
203,948 studies31 sourcesUpdated just now
PreprintCC BYbioRxiv

Lacuna: Cryptic Binding Pocket Discovery via Conformational Ensemble Analysis

  1. 1Texas A and M University

Abstract

Lacuna, an open-source Python tool for discovering cryptic binding pockets: sites that are absent or too small to detect in a protein's unbound structure and open only during conformational fluctuation. Most binding-site predictors score a single static structure, which is precisely the structure in which a cryptic site is invisible. Lacuna instead 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. Ensemble generation is pluggable: normal mode analysis by default, with implicit-solvent molecular dynamics, Boltz-2 diffusion sampling, or a user-supplied ensemble as alternatives. On the designated test fold of CryptoBench, Lacuna recovers 55.6% of cryptic sites in its top five predictions with the zero-dependency default and 66.1% with an optional PLM-assisted ranker; pooling the geometric detector with an optional learned surface detector recovers 73.9% while raising the fraction of sites found from 68.5% to 86.4%, measured on the held-out fold at five conformers. It recovers 73%, 45% and 87% on the PocketMiner set, a curated set of literature apo/holo pairs, and COACH420 respectively. The default backend completes in a median of 2.6 seconds per chain on one CPU core, so ensemble-based pocket finding does not require a simulation budget. Every site carries a continuous crypticity score, and outputs are emitted as docking-ready Boltz YAML constraints, AutoDock Vina boxes, pseudoatom PDB files, and the generated conformational ensemble as a multi-model PDB. Lacuna is MIT licensed and available at https://github.com/mooreneural/lacuna and on PyPI as lacuna-pockets.

Related

  1. Kryptix-1: Conformational Ensemble Sampling Substantially Improves Cryptic Pocket Detection Relative to Static-Structure and Prior Computational Approaches
    R. Varghese, P. Tiwary, K. Oswal
    bioRxivPreprintCC BY-NC-NDFull textBioinformatics & computational biologybioRxiv
  2. SIMORGH: Ensemble-Aware Geometric Deep Learning for Apo-State and Cryptic Ligand Binding Site Prediction
    O. Mokhtari, A. Naghsh Nilchi, B. Grüning +2
    bioRxivPreprintCC BY-NDFull textBioinformatics & computational biologybioRxiv
  3. TopoFlow: Evolutionarily Conditioned Flow Matching for Protein Conformational Ensemble Generation
    X. Yang, X. Cui, X. LI +4
    bioRxivPreprintAll rights reservedFull textBioinformatics & computational biologybioRxiv
  4. trFlow: ultrafast all-atom protein conformational ensemble generation via conditional flow matching
    C. Xiang, K. Zhao, Z. Peng +2
    bioRxivPreprintCC BY-NC-NDFull textBioinformatics & computational biologybioRxiv
  5. Ensemble tests mask missing dynamics in protein conformational generators
    K. Liu, Q. Qian, Y. Chi
    bioRxivPreprintCC BYFull textBioinformatics & computational biologybioRxiv
BibTeX
@misc{moore2026lacuna,
  title = {{Lacuna: Cryptic Binding Pocket Discovery via Conformational Ensemble Analysis}},
  author = {C. Moore},
  howpublished = {bioRxiv},
  year = {2026},
  month = aug,
  doi = {10.64898/2026.08.14.744956},
  url = {https://www.biorxiv.org/content/10.64898/2026.08.14.744956v2},
  note = {CC BY},
}
RIS
TY  - UNPB
TI  - Lacuna: Cryptic Binding Pocket Discovery via Conformational Ensemble Analysis
AU  - C. Moore
PY  - 2026
DA  - 2026/08/14
PB  - bioRxiv
DO  - 10.64898/2026.08.14.744956
UR  - https://www.biorxiv.org/content/10.64898/2026.08.14.744956v2
AB  - Lacuna, an open-source Python tool for discovering cryptic binding pockets: sites that are absent or too small to detect in a protein's unbound structure and open only during conformational fluctuation. Most binding-site predictors score a single static structure, which is precisely the structure in which a cryptic site is invisible. Lacuna instead 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. Ensemble generation is pluggable: normal mode analysis by default, with implicit-solvent molecular dynamics, Boltz-2 diffusion sampling, or a user-supplied ensemble as alternatives. On the designated test fold of CryptoBench, Lacuna recovers 55.6% of cryptic sites in its top five predictions with the zero-dependency default and 66.1% with an optional PLM-assisted ranker; pooling the geometric detector with an optional learned surface detector recovers 73.9% while raising the fraction of sites found from 68.5% to 86.4%, measured on the held-out fold at five conformers. It recovers 73%, 45% and 87% on the PocketMiner set, a curated set of literature apo/holo pairs, and COACH420 respectively. The default backend completes in a median of 2.6 seconds per chain on one CPU core, so ensemble-based pocket finding does not require a simulation budget. Every site carries a continuous crypticity score, and outputs are emitted as docking-ready Boltz YAML constraints, AutoDock Vina boxes, pseudoatom PDB files, and the generated conformational ensemble as a multi-model PDB. Lacuna is MIT licensed and available at https://github.com/mooreneural/lacuna and on PyPI as lacuna-pockets.
ER  -