PofoliaShared via Pofolia

ACS Omega· 2026Q1

Poke: Fast and Reliable Neural-Network-Based Identification of Protein Ligandable Sites

Enrica Colasurdo, Alberto Boldrini, Luca Terruzzi, Cassiano Langini et al.

Short summary

Poke, a new tool combining energetic mapping and a neural-network ligandability score, rapidly and reliably identifies protein binding sites, including cryptic ones, outperforming existing methods in accuracy and speed.

AI-generated from the title and abstract; the full text is not read.

Key points

  • Poke integrates energetic mapping with a neural-network ligandability score for pocket detection.
  • The tool identifies both static and dynamic (cryptic) ligandable sites, even in molecular dynamics trajectories.
  • Benchmarking demonstrates Poke's competitive accuracy, improved ranking, and superior computational efficiency compared to existing methods.
  • An application successfully tracked a validated cryptic pocket in TEM-1 β-lactamase simulations.

AI-generated from the title and abstract; the full text is not read.

Abstract

Abstract Accurate identification of ligandable pockets is of key relevance for structure-based drug design; however, their identification remains challenging, particularly for cryptic sites that become accessible only upon conformational changes. Here, we introduce Poké, a high-performance pocket scouting tool that combines energetic mapping with a neural-network-based ligandability score, enabling rapid and reliable binding site detection in both static structures and long-timescale molecular dynamics (MD) trajectories. Poké identifies low-energy regions on protein surfaces through probe-based grid energy calculations, expands and clusters these regions into coherent pocket volumes, and computes physicochemical descriptors that are integrated into a learned ligandability estimator. The scoring model is trained on pockets identified across large data sets using docking-derived binding score distributions, allowing robust ranking of candidate sites. Benchmarking on publicly available data sets demonstrates competitive pocket detection accuracy, improved ranking performance, and substantially enhanced computational efficiency compared to widely used pocket detectors. As a representative application, we apply Poké to mixed-solvent MD simulations of TEM-1 β-lactamase, showing efficient tracking of an experimentally validated cryptic pocket and its dynamic ligandability along the trajectory. Overall, Poké enables scalable, high-throughput ligandability assessment across extensive conformational landscapes.

The authors' abstract, as published at the source. ACS Omega, 2026 · DOI ↗

TakeawaysPremium
Ask the paperFree account

Continue with a free account

Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.

Continue free on the web

Sign in with Google or Apple; no card needed. You come back to this paper.

On your phone:

Field: Computational Theory and Mathematics

Computational Theory and MathematicsComputer Science