Protein-ligand binding affinity prediction based on profiles of intermolecular contacts

Ensembling methods for protein-ligand binding affinity prediction

Protein-ligand binding affinity prediction is a key element of computer-aided drug discovery. Most of the existing deep learning methods for protein-ligand binding affinity prediction utilize single models and suffer from low accuracy and generalization capability. In this paper, we train 13 deep learning models from combinations of 5 input features. Then, we explore all possible ensembles of the trained models to find the best ensembles. Our deep learning models use cross-attention and self-attention layers to extract short and long-range interactions. Our method is named Ensemble Binding Affinity (EBA). EBA extracts information from various models using different combinations of input features, such as simple 1D sequential and structural features of the protein-ligand complexes rather than 3D complex features. EBA is implemented to accurately predict the binding affinity of a protein-ligand complex. One of our ensembles achieves the highest Pearson correlation coefficient (R) value of 0.914 and the lowest root mean square error (RMSE) value of 0.957 on the well-known benchmark test set CASF2016. Our ensembles show significant improvements of more than 15% in R-value and 19% in RMSE on both well-known benchmark CSAR-HiQ test sets over the second-best predictor named CAPLA. Furthermore, the superior performance of the ensembles across all metrics compared to existing state-of-the-art protein-ligand binding affinity prediction methods on all five benchmark test datasets demonstrates the effectiveness and robustness of our approach. Therefore, our approach to improving binding affinity prediction between proteins and ligands can contribute to improving the success rate of potential drugs and accelerate the drug development process.

MvGraphDTA: multi-view-based graph deep model for drug-target affinity prediction by introducing the graphs and line graphs

BACKGROUND

Accurately identifying drug-target affinity (DTA) plays a pivotal role in drug screening, design, and repurposing in pharmaceutical industry. It not only reduces the time, labor, and economic costs associated with biological experiments but also expedites drug development process. However, achieving the desired level of computational accuracy for DTA identification methods remains a significant challenge.

RESULTS

We proposed a novel multi-view-based graph deep model known as MvGraphDTA for DTA prediction. MvGraphDTA employed a graph convolutional network (GCN) to extract the structural features from original graphs of drugs and targets, respectively. It went a step further by constructing line graphs with edges as vertices based on original graphs of drugs and targets. GCN was also used to extract the relationship features within their line graphs. To enhance the complementarity between the extracted features from original graphs and line graphs, MvGraphDTA fused the extracted multi-view features of drugs and targets, respectively. Finally, these fused features were concatenated and passed through a fully connected (FC) network to predict DTA.

CONCLUSIONS

During the experiments, we performed data augmentation on all the training sets used. Experimental results showed that MvGraphDTA outperformed the competitive state-of-the-art methods on benchmark datasets for DTA prediction. Additionally, we evaluated the universality and generalization performance of MvGraphDTA on additional datasets. Experimental outcomes revealed that MvGraphDTA exhibited good universality and generalization capability, making it a reliable tool for drug-target interaction prediction.

Current perspectives and trend of computer-aided drug design: a review and bibliometric analysis

AIM

Computer-aided drug design (CADD) is a drug design technique for computing ligand-receptor interactions and is involved in various stages of drug development. To better grasp the frontiers and hotspots of CADD, we conducted a review analysis through bibliometrics.

METHODS

A systematic review of studies published between 2000 and 20 July 2023 was conducted following the PRISMA guidelines. Literature on CADD was selected from the Web of Science Core Collection. General information, publications, output trends, countries/regions, institutions, journals, keywords, and influential authors were visually analyzed using software such as Excel, VOSviewer, RStudio, and CiteSpace.

RESULTS

A total of 2031 publications were included. These publications primarily originated from 99 countries or regions led by the U.S. and China. Among the contributors, MacKerell AD had the highest number of articles and the greatest influence. The Journal of Medicinal Chemistry was the most cited journal, whereas the Journal of Chemical Information and Modeling had the highest number of publications.

CONCLUSIONS

Influential authors in the field were identified. Current research shows active collaboration between countries, institutions, and companies. CADD technologies such as homology modeling, pharmacophore modeling, quantitative conformational relationships, molecular docking, molecular dynamics simulation, binding free energy prediction, and high-throughput virtual screening can effectively improve the efficiency of new drug discovery. Artificial intelligence-assisted drug design and screening based on CADD represent key topics that will influence future development. Furthermore, this paper will be helpful in better understanding the frontiers and hotspots of CADD.

Structure-based, deep-learning models for protein-ligand binding affinity prediction

The launch of AlphaFold series has brought deep-learning techniques into the molecular structural science. As another crucial problem, structure-based prediction of protein-ligand binding affinity urgently calls for advanced computational techniques. Is deep learning ready to decode this problem? Here we review mainstream structure-based, deep-learning approaches for this problem, focusing on molecular representations, learning architectures and model interpretability. A model taxonomy has been generated. To compensate for the lack of valid comparisons among those models, we realized and evaluated representatives from a uniform basis, with the advantages and shortcomings discussed. This review will potentially benefit structure-based drug discovery and related areas.

Exploring Scoring Function Space: Developing Computational Models for Drug Discovery

BACKGROUND

The idea of scoring function space established a systems-level approach to address the development of models to predict the affinity of drug molecules by those interested in drug discovery.

OBJECTIVE

Our goal here is to review the concept of scoring function space and how to explore it to develop machine learning models to address protein-ligand binding affinity.

METHODS

We searched the articles available in PubMed related to the scoring function space. We also utilized crystallographic structures found in the protein data bank (PDB) to represent the protein space.

RESULTS

The application of systems-level approaches to address receptor-drug interactions allows us to have a holistic view of the process of drug discovery. The scoring function space adds flexibility to the process since it makes it possible to see drug discovery as a relationship involving mathematical spaces.

CONCLUSION

The application of the concept of scoring function space has provided us with an integrated view of drug discovery methods. This concept is useful during drug discovery, where we see the process as a computational search of the scoring function space to find an adequate model to predict receptor-drug binding affinity.

ResBiGAAT: Residual Bi-GRU with attention for protein-ligand binding affinity prediction

Protein-ligand interaction plays a crucial role in drug discovery, facilitating efficient drug development and enabling drug repurposing. Several computational algorithms, such as Graph Neural Networks and Convolutional Neural Networks, have been proposed to predict the binding affinity using the three-dimensional structure of ligands and proteins. However, there are limitations due to the need for experimental characterization of the three-dimensional structure of protein sequences, which is still lacking for some proteins. Moreover, these models often suffer from unnecessary complexity, resulting in extraneous computations. This study presents ResBiGAAT, a novel deep learning model that combines a deep Residual Bidirectional Gated Recurrent Unit with two-sided self-attention mechanisms. ResBiGAAT leverages protein and ligand sequence-level features and their physicochemical properties to efficiently predict protein-ligand binding affinity. Through rigorous evaluation using 5-fold cross-validation, we demonstrate the performance of our proposed approach. The model exhibits competitive performance on an external dataset, highlighting its generalizability. Our publicly available web interface, located at resbigaat.streamlit.app, allows users to conveniently input protein and ligand sequences to estimate binding affinity.

Predicting Affinity Through Homology (PATH): Interpretable Binding Affinity Prediction with Persistent Homology

Accurate binding affinity prediction is crucial to structure-based drug design. Recent work used computational topology to obtain an effective representation of protein-ligand interactions. Although persistent homology encodes geometric features, previous works on binding affinity prediction using persistent homology employed uninterpretable machine learning models and failed to explain the underlying geometric and topological features that drive accurate binding affinity prediction. In this work, we propose a novel, interpretable algorithm for protein-ligand binding affinity prediction. Our algorithm achieves interpretability through an effective embedding of distances across bipartite matchings of the protein and ligand atoms into real-valued functions by summing Gaussians centered at features constructed by persistent homology. We name these functions internuclear persistent contours (IPCs) . Next, we introduce persistence fingerprints , a vector with 10 components that sketches the distances of different bipartite matching between protein and ligand atoms, refined from IPCs. Let the number of protein atoms in the protein-ligand complex be n , number of ligand atoms be m , and ω ≈ 2.4 be the matrix multiplication exponent. We show that for any 0 < ε < 1, after an 𝒪 ( mn log( mn )) preprocessing procedure, we can compute an ε -accurate approximation to the persistence fingerprint in 𝒪 ( m log 6 ω ( m/" )) time, independent of protein size. This is an improvement in time complexity by a factor of 𝒪 (( m + n ) 3 ) over any previous binding affinity prediction that uses persistent homology. We show that the representational power of persistence fingerprint generalizes to protein-ligand binding datasets beyond the training dataset. Then, we introduce PATH , Predicting Affinity Through Homology, an interpretable, small ensemble of shallow regression trees for binding affinity prediction from persistence fingerprints. We show that despite using 1,400-fold fewer features, PATH has comparable performance to a previous state-of-the-art binding affinity prediction algorithm that uses persistent homology features. Moreover, PATH has the advantage of being interpretable. Finally, we visualize the features captured by persistence fingerprint for variant HIV-1 protease complexes and show that persistence fingerprint captures binding-relevant structural mutations. The source code for PATH is released open-source as part of the osprey protein design software package.

CurvAGN: Curvature-based Adaptive Graph Neural Networks for Predicting Protein-Ligand Binding Affinity

Accurately predicting the binding affinity between proteins and ligands is crucial for drug discovery. Recent advances in graph neural networks (GNNs) have made significant progress in learning representations of protein-ligand complexes to estimate binding affinities. To improve the performance of GNNs, there frequently needs to look into protein-ligand complexes from geometric perspectives. While the "off-the-shelf" GNNs could incorporate some basic geometric structures of molecules, such as distances and angles, through modeling the complexes as homophilic graphs, these solutions seldom take into account the higher-level geometric attributes like curvatures and homology, and also heterophilic interactions.To address these limitations, we introduce the Curvature-based Adaptive Graph Neural Network (CurvAGN). This GNN comprises two components: a curvature block and an adaptive attention guided neural block (AGN). The curvature block encodes multiscale curvature informaton, then the AGN, based on an adaptive graph attention mechanism, incorporates geometry structure including angle, distance, and multiscale curvature, long-range molecular interactions, and heterophily of the graph into the protein-ligand complex representation. We demonstrate the superiority of our proposed model through experiments conducted on the PDBbind-V2016 core dataset.

CAPLA: improved prediction of protein-ligand binding affinity by a deep learning approach based on a cross-attention mechanism

MOTIVATION

Accurate and rapid prediction of protein-ligand binding affinity is a great challenge currently encountered in drug discovery. Recent advances have manifested a promising alternative in applying deep learning-based computational approaches for accurately quantifying binding affinity. The structure complementarity between protein-binding pocket and ligand has a great effect on the binding strength between a protein and a ligand, but most of existing deep learning approaches usually extracted the features of pocket and ligand by these two detached modules.

RESULTS

In this work, a new deep learning approach based on the cross-attention mechanism named CAPLA was developed for improved prediction of protein-ligand binding affinity by learning features from sequence-level information of both protein and ligand. Specifically, CAPLA employs the cross-attention mechanism to capture the mutual effect of protein-binding pocket and ligand. We evaluated the performance of our proposed CAPLA on comprehensive benchmarking experiments on binding affinity prediction, demonstrating the superior performance of CAPLA over state-of-the-art baseline approaches. Moreover, we provided the interpretability for CAPLA to uncover critical functional residues that contribute most to the binding affinity through the analysis of the attention scores generated by the cross-attention mechanism. Consequently, these results indicate that CAPLA is an effective approach for binding affinity prediction and may contribute to useful help for further consequent applications.

AVAILABILITY AND IMPLEMENTATION

The source code of the method along with trained models is freely available at https://github.com/lennylv/CAPLA.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.