A review of mathematical representations of biomolecular data

Abstract

Recently, machine learning (ML) has established itself in various worldwide benchmarking competitions in computational biology, including Critical Assessment of Structure Prediction (CASP) and Drug Design Data Resource (D3R) Grand Challenges. However, the intricate structural complexity and high ML dimensionality of biomolecular datasets obstruct the efficient application of ML algorithms in the field. In addition to data and algorithm, an efficient ML machinery for biomolecular predictions must include structural representation as an indispensable component. Mathematical representations that simplify the biomolecular structural complexity and reduce ML dimensionality have emerged as a prime winner in D3R Grand Challenges. This review is devoted to the recent advances in developing low-dimensional and scalable mathematical representations of biomolecules in our laboratory. We discuss three classes of mathematical approaches, including algebraic topology, differential geometry, and graph theory. We elucidate how the physical and biological challenges have guided the evolution and development of these mathematical apparatuses for massive and diverse biomolecular data. We focus the performance analysis on the protein-ligand binding predictions in this review although these methods have had tremendous success in many other applications, such as protein classification, virtual screening, and the predictions of solubility, solvation free energy, toxicity, partition coefficient, protein folding stability changes upon mutation, etc.

Unveiling the molecular mechanism of SARS-CoV-2 main protease inhibition from 137 crystal structures using algebraic topology and deep learning

“…This is a prevalent test set to assert the scoring ability of a binding affinity prediction model and has attracted lots of research groups to devote the effort to improve the Pearson's correlation coefficient (R p ) and Kendall's tau (s) on this core set performance. 18,42,43 In the current work, we merge the PDBbind v2019, SARS-CoV PDB-BA, and SARS-CoV 2D sets but removing the duplicates and excluding the PDBbind v2016 core set complexes to attain a training set of 17 211 complexes. MathDL with the architecture described in Section 3.2.1 is trained on those complexes.…”

A review on compound-protein interaction prediction methods: Data, format, representation and model

“…It consists of 168 integer values that describe the complex of ligand-receptor (compound-protein) by considering the set of eight types of interaction for a pair of AA and an atom. In addition, Nguyen et al [148] reviewed in detail how biomolecular data of high complexity and dimensionality are converted to features using mathematical methods.…”

Identifying metal binding amino acids based on backbone geometries as a tool for metalloprotein engineering

“…The representation of sequence and structure data for machine-learning has enabled advances in protein design and structure prediction. 34,35 This study showed that backbone geometries of a small number of amino acids (three or four) involved in metal binding can be compressed to an efficient, order-independent, mathematical representation that captures the three dimensional geometry of the metal-binding amino acids with no loss of prediction accuracy compared with the full set of orderdependent internal coordinates. The compressed features can be fed into a simple and fast machine learning model that can distinguish between different kinds of metal cofactors with an overall accuracy of 95%, and the probabilities that are generated by the machine-learning model are useful for further discernment between FPs and TPs.…”