Riemannian Geometry and Molecular Surfaces I: Spectrum of the Laplacian
Ligand-based virtual screening aims to reduce the cost and duration of drug discovery campaigns. Shape similarity can be used to screen large databases, with the goal of predicting potential new hits by comparing to molecules with known favourable properties. This paper presents the theory underpinning RGMolSA, a new alignment-free and mesh-free surface-based molecular shape descriptor derived from the mathematical theory of Riemannian geometry. The treatment of a molecule as a series of intersecting spheres allows the description of its surface geometry using the Riemannian metric, obtained by considering the spectrum of the Laplacian. This gives a simple vector descriptor constructed of the weighted surface area and eight non-zero eigenvalues, which capture the surface shape. We demonstrate the potential of our method by considering a series of PDE5 inhibitors that are known to have similar shape as an initial test case. RGMolSA displays promise when compared to existing shape descriptors and in its capability to handle different molecular conformers. The code and data used to produce the results are available via GitHub: https://github.com/RPirie96/RGMolSA.
Code (1)
Tasks
Drug DiscoverySimilar Papers 제목 키워드 기반
Improved graph Laplacian via geometric self-consistency
We address the problem of setting the kernel bandwidth used by Manifold Learning algorithms to construct the graph Laplacian. Exploiting the connection between manifold geometry, represented by the Riemannian metric, and…
Riemannian geometry for efficient analysis of protein dynamics data
An increasingly common viewpoint is that protein dynamics data sets reside in a non-linear subspace of low conformational energy. Ideal data analysis tools for such data sets should therefore account for such non-linear …
Graph Laplacians, Riemannian Manifolds and their Machine-Learning
Graph Laplacians as well as related spectral inequalities and (co-)homology provide a foray into discrete analogues of Riemannian manifolds, providing a rich interplay between combinatorics, geometry and theoretical phys…
BIG-bench Machine LearningTopological Data AnalysisNon-linear dimensionality reduction: Riemannian metric estimation and the problem of geometric discovery
In recent years, manifold learning has become increasingly popular as a tool for performing non-linear dimensionality reduction. This has led to the development of numerous algorithms of varying degrees of complexity tha…
Dimensionality ReductionThe embedding dimension of Laplacian eigenfunction maps
Any closed, connected Riemannian manifold $M$ can be smoothly embedded by its Laplacian eigenfunction maps into $\mathbb{R}^m$ for some $m$. We call the smallest such $m$ the maximal embedding dimension of $M$. We show t…