Skip to content

Cryptic Binding Site Prediction Using Equivariant Graph Neural Networks with Kolmogorov-Arnold Networks.

Sep 2026 · IEEE journal of biomedical and health informatics · Vol PP · 0 citations
Medicine

TL;DR

CrypKANet is an innovative multimodal predictive framework for cryptic binding site identification that integrates EGNN, gated attention mechanisms, and Kolmogorov-Arnold Network (KAN) and exhibits excellent generalization performance on protein-protein interaction sites and ligand binding site tasks.

Abstract

Cryptic binding sites (CBSs) are crucial functional sites that become accessible following conformational changes by ligand binding. They play a significant role in expanding the scope of druggable targets and revealing the dynamic regulatory mechanisms of proteins. Most existing computational methods rely on holo (ligand-bound) structures and struggle to effectively identify CBSs in the apo (ligand-free) state. Furthermore, these methods fail to account for protein three-dimensional conformational changes and spatial geometric information, often making it difficult to explain the dynamic characteristics of CBS formation.To address these challenges, we present CrypKANet, an innovative multimodal predictive framework for cryptic binding site identification that integrates EGNN, gated attention mechanisms, and Kolmogorov-Arnold Network (KAN). Our framework employs a two-branch design to independently encode geometric and biochemical features: the EGNN branch is dedicated to explicitly capturing three-dimensional spatial restraints and conformational dynamics, whereas the GINE branch strengthens the representation of residue-level chemical interactions and topological connectivity. Finally, the model predicts cryptic binding sites through the KAN classifier. Experimental results on the CBS benchmark dataset demonstrate that CrypKANet outperforms the existing state-of-the-art methods, and exhibits excellent generalization performance on protein-protein interaction sites and ligand binding site tasks.

View source

Similar papers

Sep 2026

LGBind: A structure-guided deep learning framework for accurate prediction of protein-ligand binding sites.

LGBind is introduced, a structure-guided deep learning framework for generalized, ligand-conditioned binding site identification and demonstrates profound robustness and generalization in predicting novel ligand-target interactions, and demonstrates remarkable versatility.

Yun-Feng Li, Xing-Yu Liu, Yi-Jia Liu et al. · 0 citations
#artificial intelligence Preprint Oct 2026

PIT-GCL: Protein Interaction using Topological Graph Contrastive Learning

Protein binding prediction is central to target identification, therapeutic binder design, and large scale screening, yet remains challenging because binding depends on sequence, three dimensional geometry, and global structural organization. Recent folding models such as AlphaFold3 and Boltz-2 have substantially impro...

Jae Won Choi, Ryoonki Hong, Alan Liang et al. · 0 citations
Preprint Sep 2026

PHL: Persistent Hyperdigraph Learning for Protein-Protein Binding Affinity Prediction

Persistent homology and persistent Laplacians have become effective descriptors of large molecular binding interactions, the latter encoding multiscale geometry and spectral information beyond the harmonic subspace. Both, however, are built on undirected graphs and pairwise contracts, while the interactions that determ...

Xing-Jian Xu, Chun-Mei Wang, Jia-Hui Chen · 0 citations
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
Preprint Aug 2026

PSLL: Persistent Sheaf Laplacian Learning for Protein-Ligand Binding Affinity Prediction

The computational results indicate that the proposed Persistent Sheaf Laplacian learning (PSLL) model achieves strong predictive performance across benchmark datasets, highlighting its potential as an interpretable and mathematically grounded framework with promising generalizability for molecular machine learning and...

Mushal Zia, Benjamin Jones, Guo-Wei Wei · 0 citations
Open access Sep 2026

Local structural preference maps encode transferable protein-interface energetics

Relating the drivers of binding affinity to structural features remains difficult because affinity emerges from many weak, context-dependent interactions, while experimental affinity and mutation data are limited. Here, we ask whether a machine-learning model can learn energetically relevant interaction preferences dir...

Maximilian Kienlein, Filipe Menezes, Phillip Grass et al. · 0 citations

Related blog posts

Microsoft Research Blog Jul 13, 2026

Verifying Rust cryptography in SymCrypt, from standards to code

Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.

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