PML is introduced, a novel computational framework that describes a binding interface as a family of multiscale manifolds, and results indicate that much of what determines binding strength is encoded in the shape of the interface itself, and that a single geometric description serves both classes without hand-tailored features.
Abstract
Predicting how tightly two biomolecules bind remains a major challenge, in part because different interaction classes present dissimilar interfaces, from compact metal-coordinated pockets to broad, featureless protein surfaces. We introduce persistent manifold learning (PML), a novel computational framework that describes a binding interface as a family of multiscale manifolds. Boundary-Induced Graph Laplacian, a discrete realization of de Rham–Hodge theory, then extracts topological invariants together with nonharmonic spectral information, capturing the geometry of an interface as well as its topology. These manifold embeddings are combined with protein and molecular language model representations and paired with gradient boosting decision trees. Our PML outperforms state-of-the-art methods on metalloprotein–ligand and protein–protein benchmarks. Relevance to Life Sciences. This work addresses a central problem in molecular biology and drug discovery: how to determine, from molecular structure alone, how tightly a molecule will bind to its target. Binding affinity governs therapeutic potency and selectivity, yet measuring it experimentally is slow and costly, making computational prediction essential for prioritizing candidates from large libraries. We apply our framework to two target classes ordinarily handled by separate methods: metalloenzymes, whose metal-coordinated active sites have long been exploited by drugs, and protein–protein interfaces, which regulate signaling and immune response yet resist conventional small molecules. Our results indicate that much of what determines binding strength is encoded in the shape of the interface itself, and that a single geometric description serves both classes without hand-tailored features. This suggests manifold-based representations may extend to other systems in which structure and sequence jointly determine function. Mathematical Content. The core of our approach involves de Rham–Hodge theory on compact Riemannian manifolds with boundary, a foundational tool in differential geometry rarely applied to molecular data. Binding interfaces are modeled as sublevel sets of Gaussian density fields, producing a filtration of manifolds whose topological transitions occur at the critical values of the level set function, as governed by Morse theory. The topology of each manifold is recovered from the kernels of Hodge Laplacians under normal and tangential boundary conditions, whose dimensions are Betti numbers by the Hodge and Friedrichs theorems, while their nonzero spectra reflect geometry. Discretization proceeds through discrete exterior calculus on Cartesian grids, yielding Boundary-Induced Graph Laplacians whose spectral analysis reduces to the singular values of the discrete differentials. Extending this across the filtration leads to persistent Hodge Laplacians on evolving manifolds, combining differential geometry, algebraic topology, and spectral theory into a multiscale representation of molecular shape.
Accurate identification of near-native ligand binding poses is a central challenge in structure-based drug design. From a physical point of view, the successful construction of a protein-ligand complex structure is dependent on whether protein and ligand can form enough atomically pairwise interactions that result in a...
Zhen-Qiang Zhang, Zhihao Wang, Yang Liu et al.· Journal of Chemical Informat...· 0 citations
Predicting ligand binding sites on protein surfaces requires capturing complex local geometries and satisfying physical constraints. Existing voxel-based methods suffer from high computational costs and rotation sensitivity, while standard point-cloud GNNs often lack geometric completeness—failing to distinguish chiral...
Kang-Xin Chen, Jie-Yu Zhao, Jin-Li Hu et al.· Proceedings of the Thirty-Fi...· 0 citations
An Algebraic Graph Neural Network model designed to encode molecular structures into a low-dimensional graph representation while preserving critical biochemical interactions is introduced, demonstrating superior performance in binding affinity prediction compared to state-of-the-art scoring functions.
Augustine Ouru, Xi Chen, Cameron Yeagle et al.· Computational and Mathematic...· 0 citations
Predicting protein–protein binding free energy (ΔG) from structure remains a central challenge in computational biophysics. Here, we present GULP (Graph-based Unified Learning for Protein binding), a graph neural network (GNN) that jointly learns from a residue-level graph representation of the binding interface and...
This study presents a method to derive optimized CV from transition state region (TS) via an interpretable machine learning (ML) model, Elastic Net, which greatly accelerate ligand binding-unbinding transitions and achieves rapid free energy surface (FES) convergence across diverse systems.
This work introduces a scalable TDA framework for extracting information on PPIs directly from localized protein surface patches that leverages multiscale topological descriptors, evaluated from patch-wise point cloud representations of protein mesh surfaces, combined with supervised machine learning models for interfa...
Angan Mukherjee, ByungUk Park, Adam Malmstrom et al.· bioRxiv· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.