Assessing protein–ligand interaction scoring functions with the CASF-2013 benchmark

Conformational Space Profiling Enhances Generic Molecular Representation for AI-Powered Ligand-Based Drug Discovery

The molecular representation model is a neural network that converts molecular representations (SMILES, Graph) into feature vectors, and is an essential module applied across a wide range of artificial intelligence-driven drug discovery scenarios. However, current molecular representation models rarely consider the three-dimensional conformational space of molecules, losing sight of the dynamic nature of small molecules as well as the essence of molecular conformational space that covers the heterogeneity of molecule properties, such as the multi-target mechanism of action, recognition of different biomolecules, dynamics in cytoplasm and membrane. In this study, a new model named GeminiMol is proposed to incorporate conformational space profiles into molecular representation learning, which extracts the feature of capturing the complicated interplay between the molecular structure and the conformational space. Although GeminiMol is pre-trained on a relatively small-scale molecular dataset (39290 molecules), it shows balanced and superior performance not only on 67 molecular properties predictions but also on 73 cellular activity predictions and 171 zero-shot tasks (including virtual screening and target identification). By capturing the molecular conformational space profile, the strategy paves the way for rapid exploration of chemical space and facilitates changing paradigms for drug design.

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.

DEAttentionDTA: protein-ligand binding affinity prediction based on dynamic embedding and self-attention

MOTIVATION

Predicting protein-ligand binding affinity is crucial in new drug discovery and development. However, most existing models rely on acquiring 3D structures of elusive proteins. Combining amino acid sequences with ligand sequences and better highlighting active sites are also significant challenges.

RESULTS

We propose an innovative neural network model called DEAttentionDTA, based on dynamic word embeddings and a self-attention mechanism, for predicting protein-ligand binding affinity. DEAttentionDTA takes the 1D sequence information of proteins as input, including the global sequence features of amino acids, local features of the active pocket site, and linear representation information of the ligand molecule in the SMILE format. These three linear sequences are fed into a dynamic word-embedding layer based on a 1D convolutional neural network for embedding encoding and are correlated through a self-attention mechanism. The output affinity prediction values are generated using a linear layer. We compared DEAttentionDTA with various mainstream tools and achieved significantly superior results on the same dataset. We then assessed the performance of this model in the p38 protein family.

AVAILABILITY AND IMPLEMENTATION

The resource codes are available at https://github.com/whatamazing1/DEAttentionDTA.

Advances in machine-learning approaches to RNA-targeted drug design

RNA molecules play multifaceted functional and regulatory roles within cells and have garnered significant attention in recent years as promising therapeutic targets. With remarkable successes achieved by artificial intelligence (AI) in different fields such as computer vision and natural language processing, there is a growing imperative to harness AI's potential in computer-aided drug design (CADD) to discover novel drug compounds that target RNA. Although machine-learning (ML) approaches have been widely adopted in the discovery of small molecules targeting proteins, the application of ML approaches to model interactions between RNA and small molecule is still in its infancy. Compared to protein-targeted drug discovery, the major challenges in ML-based RNA-targeted drug discovery stem from the scarcity of available data resources. With the growing interest and the development of curated databases focusing on interactions between RNA and small molecule, the field anticipates a rapid growth and the opening of a new avenue for disease treatment. In this review, we aim to provide an overview of recent advancements in computationally modeling RNA-small molecule interactions within the context of RNA-targeted drug discovery, with a particular emphasis on methodologies employing ML techniques.

GEMF: a novel geometry-enhanced mid-fusion network for PLA prediction

Accurate prediction of protein-ligand binding affinity (PLA) is important for drug discovery. Recent advances in applying graph neural networks have shown great potential for PLA prediction. However, existing methods usually neglect the geometric information (i.e. bond angles), leading to difficulties in accurately distinguishing different molecular structures. In addition, these methods also pose limitations in representing the binding process of protein-ligand complexes. To address these issues, we propose a novel geometry-enhanced mid-fusion network, named GEMF, to learn comprehensive molecular geometry and interaction patterns. Specifically, the GEMF consists of a graph embedding layer, a message passing phase, and a multi-scale fusion module. GEMF can effectively represent protein-ligand complexes as graphs, with graph embeddings based on physicochemical and geometric properties. Moreover, our dual-stream message passing framework models both covalent and non-covalent interactions. In particular, the edge-update mechanism, which is based on line graphs, can fuse both distance and angle information in the covalent branch. In addition, the communication branch consisting of multiple heterogeneous interaction modules is developed to learn intricate interaction patterns. Finally, we fuse the multi-scale features from the covalent, non-covalent, and heterogeneous interaction branches. The extensive experimental results on several benchmarks demonstrate the superiority of GEMF compared with other state-of-the-art methods.

Water Network-Augmented Two-State Model for Protein-Ligand Binding Affinity Prediction

Water network rearrangement from the ligand-unbound state to the ligand-bound state is known to have significant effects on the protein-ligand binding interactions, but most of the current machine learning-based scoring functions overlook these effects. In this study, we endeavor to construct a comprehensive and realistic deep learning model by incorporating water network information into both ligand-unbound and -bound states. In particular, extended connectivity interaction features were integrated into graph representation, and graph transformer operator was employed to extract features of the ligand-unbound and -bound states. Through these efforts, we developed a water network-augmented two-state model called ECIFGraph::HM-Holo-Apo. Our new model exhibits satisfactory performance in terms of scoring, ranking, docking, screening, and reverse screening power tests on the CASF-2016 benchmark. In addition, it can achieve superior performance in large-scale docking-based virtual screening tests on the DEKOIS2.0 data set. Our study highlights that the use of a water network-augmented two-state model can be an effective strategy to bolster the robustness and applicability of machine learning-based scoring functions, particularly for targets with hydrophilic or solvent-exposed binding pockets.

Encoding Molecular Docking for Quantum Computers

Molecular docking is important in drug discovery but is burdensome for classical computers. Here, we introduce Grid Point Matching (GPM) and Feature Atom Matching (FAM) to accelerate pose sampling in molecular docking by encoding the problem into quadratic unconstrained binary optimization (QUBO) models so that it could be solved by quantum computers like the coherent Ising machine (CIM). As a result, GPM shows a sampling power close to that of Glide SP, a method performing an extensive search. Moreover, it is estimated to be 1000 times faster on the CIM than on classical computers. Our methods could boost virtual drug screening of small molecules and peptides in future.

In Silico Screening of Natural Flavonoids against 3-Chymotrypsin-like Protease of SARS-CoV-2 Using Machine Learning and Molecular Modeling

The "Long-COVID syndrome" has posed significant challenges due to a lack of validated therapeutic options. We developed a novel multi-step virtual screening strategy to reliably identify inhibitors against 3-chymotrypsin-like protease of SARS-CoV-2 from abundant flavonoids, which represents a promising source of antiviral and immune-boosting nutrients. We identified 57 interacting residues as contributors to the protein-ligand binding pocket. Their energy interaction profiles constituted the input features for Machine Learning (ML) models. The consensus of 25 classifiers trained using various ML algorithms attained 93.9% accuracy and a 6.4% false-positive-rate. The consensus of 10 regression models for binding energy prediction also achieved a low root-mean-square error of 1.18 kcal/mol. We screened out 120 flavonoid hits first and retained 50 drug-like hits after predefined ADMET filtering to ensure bioavailability and safety profiles. Furthermore, molecular dynamics simulations prioritized nine bioactive flavonoids as promising anti-SARS-CoV-2 agents exhibiting both high structural stability (root-mean-square deviation < 5 Å for 218 ns) and low MM/PBSA binding free energy (<-6 kcal/mol). Among them, KB-2 (PubChem-CID, 14630497) and 9-O-Methylglyceofuran (PubChem-CID, 44257401) displayed excellent binding affinity and desirable pharmacokinetic capabilities. These compounds have great potential to serve as oral nutraceuticals with therapeutic and prophylactic properties as care strategies for patients with long-COVID syndrome.

The Impact of Data on Structure-Based Binding Affinity Predictions Using Deep Neural Networks

Artificial intelligence (AI) has gained significant traction in the field of drug discovery, with deep learning (DL) algorithms playing a crucial role in predicting protein-ligand binding affinities. Despite advancements in neural network architectures, system representation, and training techniques, the performance of DL affinity prediction has reached a plateau, prompting the question of whether it is truly solved or if the current performance is overly optimistic and reliant on biased, easily predictable data. Like other DL-related problems, this issue seems to stem from the training and test sets used when building the models. In this work, we investigate the impact of several parameters related to the input data on the performance of neural network affinity prediction models. Notably, we identify the size of the binding pocket as a critical factor influencing the performance of our statistical models; furthermore, it is more important to train a model with as much data as possible than to restrict the training to only high-quality datasets. Finally, we also confirm the bias in the typically used current test sets. Therefore, several types of evaluation and benchmarking are required to understand models' decision-making processes and accurately compare the performance of models.

Pharmacophore-based virtual screening of ZINC database, molecular modeling and designing new derivatives as potential HDAC6 inhibitors

To date, many HDAC6 inhibitors have been identified and developed but none is clinically approved as of now. Through this study, we aim to obtain novel HDAC6 selective inhibitors and provide new insights into the detailed structural design of potential HDAC6 inhibitors. A HypoGen-based 3D QSAR HDAC6 pharmacophore was built and used as a query model to screen approximately 8 million ZINC database compounds. First, the ZINC Database was filtered using ADMET, followed by pharmacophore-based library screening. Using fit value and estimated activity cutoffs, a final set of 54 ZINC hits was obtained that were further investigated using molecular docking with the crystal structure of human histone deacetylase 6 catalytic domain 2 in complex with Trichostatin A (PDB ID: 5EDU). Through detailed in silico screening of the ZINC database, we shortlisted three hits as the lead molecules for designing novel HDAC6 inhibitors with better efficacy. Docking with 5EDU, followed by ADMET and TOPKAT analysis of modified ZINC hits provided 9 novel potential HDAC6 inhibitors that possess better docking scores and 2D interactions as compared to the control ZINC hit molecules. Finally, a 50 ns MD analysis run followed by Protein-Ligand Interaction Energy (PLIE) analysis of the top scored hits provided a novel molecule N1 that showed promisingly similar results to that of Ricolinostat (a known HDAC6 inhibitor). The comparable result of the designed hits to established HDAC6 inhibitors suggests that these compounds might prove to be successful HDAC6 inhibitors in future. Designed novel hits that might act as good HDAC6 inhibitors derived from ZINC database using combined molecular docking and modeling approaches.

Identification of Cytochrome P450 2E1 as a Novel Target in Glioma and Development of Its Inhibitor as an Anti-Tumor Agent

Glioblastoma (GBM) is a devastating inflammation-related cancer for which novel therapeutic targets are urgently required. Previous studies of the authors indicate Cytochrome P450 2E1 (CYP2E1) as a novel inflammatory target and develop a specific inhibitor Q11. Here it is demonstrated that CYP2E1 overexpression is closely related to higher malignancy in GBM patients. CYP2E1 activity is positively correlated with tumor weight in GBM rats. Significantly higher CYP2E1 expression accompanied by increased inflammation is detected in a mouse GBM model. Q11, 1-(4-methyl-5-thialzolyl) ethenone, a newly developed specific inhibitor of CYP2E1 here remarkably attenuates tumor growth and prolongs survival in vivo. Q11 does not directly affect tumor cells but blocks the tumor-promoting effect of microglia/macrophage (M/Mφ) in the tumor microenvironment through PPARγ-mediated activation of the STAT-1 and NF-κB pathways and inhibition of the STAT-3 and STAT-6 pathways. The effectiveness and safety of targeting CYP2E1 in GBM are further supported by studies with Cyp2e1 knockout rodents. In conclusion, a pro-GBM mechanism in which CYP2E1-PPARγ-STAT-1/NF-κB/STAT-3/STAT-6 axis fueled tumorigenesis by reprogramming M/Mφ and Q11 as a promising anti-inflammatory agent for GBM treatment is uncovered.

Molecular docking in organic, inorganic, and hybrid systems: a tutorial review

Molecular docking simulation is a very popular and well-established computational approach and has been extensively used to understand molecular interactions between a natural organic molecule (ideally taken as a receptor) such as an enzyme, protein, DNA, RNA and a natural or synthetic organic/inorganic molecule (considered as a ligand). But the implementation of docking ideas to synthetic organic, inorganic, or hybrid systems is very limited with respect to their use as a receptor despite their huge popularity in different experimental systems. In this context, molecular docking can be an efficient computational tool for understanding the role of intermolecular interactions in hybrid systems that can help in designing materials on mesoscale for different applications. The current review focuses on the implementation of the docking method in organic, inorganic, and hybrid systems along with examples from different case studies. We describe different resources, including databases and tools required in the docking study and applications. The concept of docking techniques, types of docking models, and the role of different intermolecular interactions involved in the docking process to understand the binding mechanisms are explained. Finally, the challenges and limitations of dockings are also discussed in this review.

Graphical abstract

GB-score: Minimally designed machine learning scoring function based on distance-weighted interatomic contact features

In recent years, thanks to advances in computer hardware and dataset availability, data-driven approaches (like machine learning) have become one of the essential parts of the drug design framework to accelerate drug discovery procedures. Constructing a new scoring function, a function that can predict the binding score for a generated protein-ligand pose during docking procedure or a crystal complex, based on machine and deep learning has become an active research area in computer-aided drug design. GB-Score is a state-of-the-art machine learning-based scoring function that utilizes distance-weighted interatomic contact features, PDBbind-v2019 general set, and Gradient Boosting Trees algorithm to the binding affinity prediction. The distance-weighted interatomic contact featurization method used the distance between different ligand and protein atom types for numerical representation of the protein-ligand complex. GB-Score attains Pearson's correlation 0.862 and RMSE 1.190 on the CASF-2016 benchmark test in the scoring power metric. GB-Score's codes are freely available on the web at https://github.com/miladrayka/GB_Score.

HCovDock: an efficient docking method for modeling covalent protein-ligand interactions

Covalent inhibitors have received extensive attentions in the past few decades because of their long residence time, high binding efficiency and strong selectivity. Therefore, it is valuable to develop computational tools like molecular docking for modeling of covalent protein-ligand interactions or screening of potential covalent drugs. Meeting the needs, we have proposed HCovDock, an efficient docking algorithm for covalent protein-ligand interactions by integrating a ligand sampling method of incremental construction and a scoring function with covalent bond-based energy. Tested on a benchmark containing 207 diverse protein-ligand complexes, HCovDock exhibits a significantly better performance than seven other state-of-the-art covalent docking programs (AutoDock, Cov_DOX, CovDock, FITTED, GOLD, ICM-Pro and MOE). With the criterion of ligand root-mean-squared distance < 2.0 Å, HCovDock obtains a high success rate of 70.5% and 93.2% in reproducing experimentally observed structures for top 1 and top 10 predictions. In addition, HCovDock is also validated in virtual screening against 10 receptors of three proteins. HCovDock is computationally efficient and the average running time for docking a ligand is only 5 min with as fast as 1 sec for ligands with one rotatable bond and about 18 min for ligands with 23 rotational bonds. HCovDock can be freely assessed at http://huanglab.phys.hust.edu.cn/hcovdock/.

Comprehensive Survey of Consensus Docking for High-Throughput Virtual Screening

The rapid advances of 3D techniques for the structural determination of proteins and the development of numerous computational methods and strategies have led to identifying highly active compounds in computer drug design. Molecular docking is a method widely used in high-throughput virtual screening campaigns to filter potential ligands targeted to proteins. A great variety of docking programs are currently available, which differ in the algorithms and approaches used to predict the binding mode and the affinity of the ligand. All programs heavily rely on scoring functions to accurately predict ligand binding affinity, and despite differences in performance, none of these docking programs is preferable to the others. To overcome this problem, consensus scoring methods improve the outcome of virtual screening by averaging the rank or score of individual molecules obtained from different docking programs. The successful application of consensus docking in high-throughput virtual screening highlights the need to optimize the predictive power of molecular docking methods.

Assessment of the Generalization Abilities of Machine-Learning Scoring Functions for Structure-Based Virtual Screening

In structure-based virtual screening (SBVS), it is critical that scoring functions capture protein-ligand atomic interactions. By focusing on the local domains of ligand binding pockets, a standardized pocket Pfam-based clustering (Pfam-cluster) approach was developed to assess the cross-target generalization ability of machine-learning scoring functions (MLSFs). Subsequently, 12 typical MLSFs were evaluated using random cross-validation (Random-CV), protein sequence similarity-based cross-validation (Seq-CV), and pocket Pfam-based cross-validation (Pfam-CV) methods. Surprisingly, all of the tested models showed decreased performances from Random-CV to Seq-CV to Pfam-CV experiments, not showing satisfactory generalization capacity. Our interpretable analysis suggested that the predictions on novel targets by MLSFs were dependent on buried solvent-accessible surface area (SASA)-related features of complex structures, with greater predicted binding affinities on complexes owning larger protein-ligand interfaces. By combining buried SASA-related features with target-specific patterns that were only shared among structurally similar compounds in the same cluster, the random forest (RF)-Score attained a good performance in the Random-CV test. Based on these findings, we strongly advise assessing the generalization ability of MLSFs with the Pfam-cluster approach and being cautious with the features learned by MLSFs.

Protein-Ligand Docking in the Machine-Learning Era

Molecular docking plays a significant role in early-stage drug discovery, from structure-based virtual screening (VS) to hit-to-lead optimization, and its capability and predictive power is critically dependent on the protein-ligand scoring function. In this review, we give a broad overview of recent scoring function development, as well as the docking-based applications in drug discovery. We outline the strategies and resources available for structure-based VS and discuss the assessment and development of classical and machine learning protein-ligand scoring functions. In particular, we highlight the recent progress of machine learning scoring function ranging from descriptor-based models to deep learning approaches. We also discuss the general workflow and docking protocols of structure-based VS, such as structure preparation, binding site detection, docking strategies, and post-docking filter/re-scoring, as well as a case study on the large-scale docking-based VS test on the LIT-PCBA data set.

Predicting Protein-Ligand Docking Structure with Graph Neural Network

Modern day drug discovery is extremely expensive and time consuming. Although computational approaches help accelerate and decrease the cost of drug discovery, existing computational software packages for docking-based drug discovery suffer from both low accuracy and high latency. A few recent machine learning-based approaches have been proposed for virtual screening by improving the ability to evaluate protein-ligand binding affinity, but such methods rely heavily on conventional docking software to sample docking poses, which results in excessive execution latencies. Here, we propose and evaluate a novel graph neural network (GNN)-based framework, MedusaGraph, which includes both pose-prediction (sampling) and pose-selection (scoring) models. Unlike the previous machine learning-centric studies, MedusaGraph generates the docking poses directly and achieves from 10 to 100 times speedup compared to state-of-the-art approaches, while having a slightly better docking accuracy.

Discovery of Phenylcarbamoylazinane-1,2,4-Triazole Amides Derivatives as the Potential Inhibitors of Aldo-Keto Reductases (AKR1B1 & AKRB10): Potential Lead Molecules for Treatment of Colon Cancer

Both members of the aldo-keto reductases (AKRs) family, AKR1B1 and AKR1B10, are over-expressed in various type of cancer, making them potential targets for inflammation-mediated cancers such as colon, lung, breast, and prostate cancers. This is the first comprehensive study which focused on the identification of phenylcarbamoylazinane-1, 2,4-triazole amides (7a−o) as the inhibitors of aldo-keto reductases (AKR1B1, AKR1B10) via detailed computational analysis. Firstly, the stability and reactivity of compounds were determined by using the Guassian09 programme in which the density functional theory (DFT) calculations were performed by using the B3LYP/SVP level. Among all the derivatives, the 7d, 7e, 7f, 7h, 7j, 7k, and 7m were found chemically reactive. Then the binding interactions of the optimized compounds within the active pocket of the selected targets were carried out by using molecular docking software: AutoDock tools and Molecular operation environment (MOE) software, and during analysis, the Autodock (academic software) results were found to be reproducible, suggesting this software is best over the MOE (commercial software). The results were found in correlation with the DFT results, suggesting 7d as the best inhibitor of AKR1B1 with the energy value of −49.40 kJ/mol and 7f as the best inhibitor of AKR1B10 with the energy value of −52.84 kJ/mol. The other potent compounds also showed comparable binding energies. The best inhibitors of both targets were validated by the molecular dynamics simulation studies where the root mean square value of <2 along with the other physicochemical properties, hydrogen bond interactions, and binding energies were observed. Furthermore, the anticancer potential of the potent compounds was confirmed by cell viability (MTT) assay. The studied compounds fall into the category of drug-like properties and also supported by physicochemical and pharmacological ADMET properties. It can be suggested that the further synthesis of derivatives of 7d and 7f may lead to the potential drug-like molecules for the treatment of colon cancer associated with the aberrant expression of either AKR1B1 or AKR1B10 and other associated malignancies.

Machine-Learning- and Knowledge-Based Scoring Functions Incorporating Ligand and Protein Fingerprints

We propose a novel machine-learning-based scoring function for drug discovery that incorporates ligand and protein structural information into a knowledge-based PMF score. Molecular docking, a simulation method for structure-based drug design (SBDD), is expected to reduce the enormous costs associated with conventional experimental methods in terms of rational drug discovery. Molecular docking has two main purposes: to predict ligand-binding structures for target proteins and to predict protein-ligand binding affinity. Currently available programs of molecular docking offer an accurate prediction of ligand binding structures for many systems. However, the accurate prediction of binding affinity remains challenging. In this study, we developed a new scoring function that incorporates fingerprints representing ligand and protein structures as descriptors in the PMF score. Here, regression analysis of the scoring function was performed using the following machine learning techniques: least absolute shrinkage and selection operator (LASSO) and light gradient boosting machine (LightGBM). The results on a test data set showed that the binding affinity delivered by the newly developed scoring function has a Pearson correlation coefficient of 0.79 with the experimental value, which surpasses that of the conventional scoring functions. Further analysis provided a chemical understanding of the descriptors that contributed significantly to the improvement in prediction accuracy. Our approach and findings are useful for rational drug discovery.

Structure-guided pharmacophore based virtual screening, docking, and molecular dynamics to discover repurposed drugs as novel inhibitors against endoribonuclease Nsp15 of SARS-CoV-2

COVID-19 (Corona Virus Disease of 2019) caused by the novel 'Severe Acute Respiratory Syndrome Coronavirus-2' (SARS-CoV-2) has wreaked havoc on human health and the global economy. As a result, for new medication development, it's critical to investigate possible therapeutic targets against the novel virus. 'Non-structural protein 15' (Nsp15) endonuclease is one of the crucial targets which helps in the replication of virus and virulence in the host immune system. Here, in the current study, we developed the structure-based pharmacophore model based on Nsp15-UMP interactions and virtually screened several databases against the selected model. To validate the screening process, we docked the top hits obtained after secondary filtering (Lipinski's rule of five, ADMET & Topkat) followed by 100 ns molecular dynamics (MD) simulations. Next, to revalidate the MD simulation studies, we have calculated the binding free energy of each complex using the MM-PBSA procedure. The discovered repurposed drugs can aid the rational design of novel inhibitors for Nsp15 of the SARS-CoV-2 enzyme and may be considered for immediate drug development.

Delta Machine Learning to Improve Scoring-Ranking-Screening Performances of Protein-Ligand Scoring Functions

Protein-ligand scoring functions are widely used in structure-based drug design for fast evaluation of protein-ligand interactions, and it is of strong interest to develop scoring functions with machine-learning approaches. In this work, by expanding the training set, developing physically meaningful features, employing our recently developed linear empirical scoring function Lin_F9 (Yang, C. J. Chem. Inf. Model. 2021, 61, 4630-4644) as the baseline, and applying extreme gradient boosting (XGBoost) with Δ-machine learning, we have further improved the robustness and applicability of machine-learning scoring functions. Besides the top performances for scoring-ranking-screening power tests of the CASF-2016 benchmark, the new scoring function Δ_{Lin_F9}XGB also achieves superior scoring and ranking performances in different structure types that mimic real docking applications. The scoring powers of Δ_{Lin_F9}XGB for locally optimized poses, flexible redocked poses, and ensemble docked poses of the CASF-2016 core set achieve Pearson's correlation coefficient (R) values of 0.853, 0.839, and 0.813, respectively. In addition, the large-scale docking-based virtual screening test on the LIT-PCBA data set demonstrates the reliability and robustness of Δ_{Lin_F9}XGB in virtual screening application. The Δ_{Lin_F9}XGB scoring function and its code are freely available on the web at (https://yzhang.hpc.nyu.edu/Delta_LinF9_XGB).

RNA-ligand molecular docking: advances and challenges

With rapid advances in computer algorithms and hardware, fast and accurate virtual screening has led to a drastic acceleration in selecting potent small molecules as drug candidates. Computational modeling of RNA-small molecule interactions has become an indispensable tool for RNA-targeted drug discovery. The current models for RNA-ligand binding have mainly focused on the docking-and-scoring method. Accurate docking and scoring should tackle four crucial problems: (1) conformational flexibility of ligand, (2) conformational flexibility of RNA, (3) efficient sampling of binding sites and binding poses, and (4) accurate scoring of different binding modes. Moreover, compared with the problem of protein-ligand docking, predicting ligand binding to RNA, a negatively charged polymer, is further complicated by additional effects such as metal ion effects. Thermodynamic models based on physics-based and knowledge-based scoring functions have shown highly encouraging success in predicting ligand binding poses and binding affinities. Recently, kinetic models for ligand binding have further suggested that including dissociation kinetics (residence time) in ligand docking would result in improved performance in estimating in vivo drug efficacy. More recently, the rise of deep-learning approaches has led to new tools for predicting RNA-small molecule binding. In this review, we present an overview of the recently developed computational methods for RNA-ligand docking and their advantages and disadvantages.

Improving protein-ligand docking and screening accuracies by incorporating a scoring function correction term

Scoring functions are important components in molecular docking for structure-based drug discovery. Traditional scoring functions, generally empirical- or force field-based, are robust and have proven to be useful for identifying hits and lead optimizations. Although multiple highly accurate deep learning- or machine learning-based scoring functions have been developed, their direct applications for docking and screening are limited. We describe a novel strategy to develop a reliable protein–ligand scoring function by augmenting the traditional scoring function Vina score using a correction term (OnionNet-SFCT). The correction term is developed based on an AdaBoost random forest model, utilizing multiple layers of contacts formed between protein residues and ligand atoms. In addition to the Vina score, the model considerably enhances the AutoDock Vina prediction abilities for docking and screening tasks based on different benchmarks (such as cross-docking dataset, CASF-2016, DUD-E and DUD-AD). Furthermore, our model could be combined with multiple docking applications to increase pose selection accuracies and screening abilities, indicating its wide usage for structure-based drug discoveries. Furthermore, in a reverse practice, the combined scoring strategy successfully identified multiple known receptors of a plant hormone. To summarize, the results show that the combination of data-driven model (OnionNet-SFCT) and empirical scoring function (Vina score) is a good scoring strategy that could be useful for structure-based drug discoveries and potentially target fishing in future.

Complex machine learning model needs complex testing: Examining predictability of molecular binding affinity by a graph neural network

Drug discovery pipelines typically involve high-throughput screening of large amounts of compounds in a search of potential drugs candidates. As a chemical space of small organic molecules is huge, a "navigation" over it urges for fast and lightweight computational methods, thus promoting machine-learning approaches for processing huge pools of candidates. In this contribution, we present a graph-based deep neural network for prediction of protein-drug binding affinity and assess its predictive power under thorough testing conditions. Within the suggested approach, both protein and drug molecules are represented as graphs and passed to separate graph sub-networks, then concatenated and regressed towards a binding affinity. The neural network is trained on two binding affinity datasets-PDBbind and data imported from RCSB Protein Data Bank. In order to explore the generalization capabilities of the model we go beyond traditional random or leave-cluster-out techniques and demonstrate the need for more elaborate model performance assessment - six different strategies for test/train data partitioning (random, time- and property-arranged, protein- and ligand-clustered) with a k-fold cross-validation are engaged. Finally, we discuss the model performance in terms of a set of metrics for different split strategies and fold arrangement. Our code is available at https://github.com/SoftServeInc/affinity-by-GNN.

Assessing the Performance of Screening MM/PBSA in Protein-Ligand Interactions

Accurate calculation of the binding free energies between a protein and a ligand is the primary objective of structure-based drug design, but it still remains a challenging problem. In this work, we apply the screening molecular mechanics/Poisson Boltzmann surface area (MM/PBSA) method to calculate the binding affinity of protein-ligand interactions. Our results show that the performance of the screening MM/PBSA is better than that of the standard MM/PBSA, especially in a charged-ligand system. In addition, we also investigate the effect of the solute dielectric constant on the results, and find that the optimal solute dielectric constants are different between the neutral-ligand system and the charged-ligand system. Moreover, we also evaluate the effect of the atomic-charge methods on the performance of the screening MM/PBSA. The present study demonstrates that the screening MM/PBSA should be a reliable method for calculating binding energy of biosystems.

Ensemble learning from ensemble docking: revisiting the optimum ensemble size problem

Despite considerable advances obtained by applying machine learning approaches in protein–ligand affinity predictions, the incorporation of receptor flexibility has remained an important bottleneck. While ensemble docking has been used widely as a solution to this problem, the optimum choice of receptor conformations is still an open question considering the issues related to the computational cost and false positive pose predictions. Here, a combination of ensemble learning and ensemble docking is suggested to rank different conformations of the target protein in light of their importance for the final accuracy of the model. Available X-ray structures of cyclin-dependent kinase 2 (CDK2) in complex with different ligands are used as an initial receptor ensemble, and its redundancy is removed through a graph-based redundancy removal, which is shown to be more efficient and less subjective than clustering-based representative selection methods. A set of ligands with available experimental affinity are docked to this nonredundant receptor ensemble, and the energetic features of the best scored poses are used in an ensemble learning procedure based on the random forest method. The importance of receptors is obtained through feature selection measures, and it is shown that a few of the most important conformations are sufficient to reach 1 kcal/mol accuracy in affinity prediction with considerable improvement of the early enrichment power of the models compared to the different ensemble docking without learning strategies. A clear strategy has been provided in which machine learning selects the most important experimental conformers of the receptor among a large set of protein–ligand complexes while simultaneously maintaining the final accuracy of affinity predictions at the highest level possible for available data. Our results could be informative for future attempts to design receptor-specific docking-rescoring strategies.

Efficient calculation of protein-ligand binding free energy with GFN methods: the power of cluster model

The protein-ligand interactions are crucial in many biochemical processes and biomedical applications, yet it still remains challenging to accurately calculating the binding free energy of their interactions. In this work,...

Structure-based protein-ligand interaction fingerprints for binding affinity prediction

Binding affinity prediction (BAP) using protein–ligand complex structures is crucial to computer-aided drug design, but remains a challenging problem. To achieve efficient and accurate BAP, machine-learning scoring functions (SFs) based on a wide range of descriptors have been developed. Among those descriptors, protein–ligand interaction fingerprints (IFPs) are competitive due to their simple representations, elaborate profiles of key interactions and easy collaborations with machine-learning algorithms. In this paper, we have adopted a building-block-based taxonomy to review a broad range of IFP models, and compared representative IFP-based SFs in target-specific and generic scoring tasks. Atom-pair-counts-based and substructure-based IFPs show great potential in these tasks.

Further exploration of the structure-activity relationship of dual soluble epoxide hydrolase/fatty acid amide hydrolase inhibitors

Fatty acid amide hydrolase (FAAH) is a membrane protein that hydrolyzes endocannabinoids, and its inhibition produces analgesic and anti-inflammatory effects. The soluble epoxide hydrolase (sEH) hydrolyzes epoxyeicosatrienoic acids (EETs) to dihydroxyeicosatetraenoic acids. EETs have anti-inflammatory and inflammation resolving properties, thus inhibition of sEH consequently reduces inflammation. Concurrent inhibition of both enzymes may represent a novel approach in the treatment of chronic pain. Drugs with multiple targets can provide a superior therapeutic effect and a decrease in side effects compared to ligands with single targets. Previously, microwave-assisted methodologies were employed to synthesize libraries of benzothiazole analogs from which high affinity dual inhibitors (e.g. 3, sEH IC₅₀ = 9.6 nM; FAAH IC₅₀ = 7 nM) were identified. Here, our structure-activity relationship studies revealed that the 4-phenylthiazole moiety is well tolerated by both enzymes, producing excellent inhibition potencies in the low nanomolar range (e.g. 6o, sEH IC₅₀ = 2.5 nM; FAAH IC₅₀ = 9.8 nM). Docking experiments show that the new class of dual inhibitors bind within the catalytic sites of both enzymes. Prediction of several pharmacokinetic/pharmacodynamic properties suggest that these new dual inhibitors are good candidates for further in vivo evaluation. Finally, dual inhibitor 3 was tested in the Formalin Test, a rat model of acute inflammatory pain. The data indicate that 3 produces antinociception against the inflammatory phase of the Formalin Test in vivo and is metabolically stable following intraperitoneal administration in male rats. Further, antinociception produced by 3 is comparable to that of ketoprofen, a traditional nonsteroidal anti-inflammatory drug. The results presented here will help toward the long-term goal of developing novel non-opioid therapeutics for pain management.

Redesigning Vina@QNLM for Ultra-Large-Scale Molecular Docking and Screening on a Sunway Supercomputer

Ultra-large-scale molecular docking can improve the accuracy of lead compounds in drug discovery. In this study, we developed a molecular docking piece of software, Vina@QNLM, which can use more than 4,80,000 parallel processes to search for potential lead compounds from hundreds of millions of compounds. We proposed a task scheduling mechanism for large-scale parallelism based on Vinardo and Sunway supercomputer architecture. Then, we readopted the core docking algorithm to incorporate the full advantage of the heterogeneous multicore processor architecture in intensive computing. We successfully expanded it to 10, 465, 065 cores (1,61,001 management process elements and 0, 465, 065 computing process elements), with a strong scalability of 55.92%. To the best of our knowledge, this is the first time that 10 million cores are used for molecular docking on Sunway. The introduction of the heterogeneous multicore processor architecture achieved the best speedup, which is 11x more than that of the management process element of Sunway. The performance of Vina@QNLM was comprehensively evaluated using the CASF-2013 and CASF-2016 protein-ligand benchmarks, and the screening power was the highest out of the 27 pieces of software tested in the CASF-2013 benchmark. In some existing applications, we used Vina@QNLM to dock more than 10 million molecules to nine rigid proteins related to SARS-CoV-2 within 8.5 h on 10 million cores. We also developed a platform for the general public to use the software.

OnionNet-2: A Convolutional Neural Network Model for Predicting Protein-Ligand Binding Affinity Based on Residue-Atom Contacting Shells

One key task in virtual screening is to accurately predict the binding affinity (△G) of protein-ligand complexes. Recently, deep learning (DL) has significantly increased the predicting accuracy of scoring functions due to the extraordinary ability of DL to extract useful features from raw data. Nevertheless, more efforts still need to be paid in many aspects, for the aim of increasing prediction accuracy and decreasing computational cost. In this study, we proposed a simple scoring function (called OnionNet-2) based on convolutional neural network to predict △G. The protein-ligand interactions are characterized by the number of contacts between protein residues and ligand atoms in multiple distance shells. Compared to published models, the efficacy of OnionNet-2 is demonstrated to be the best for two widely used datasets CASF-2016 and CASF-2013 benchmarks. The OnionNet-2 model was further verified by non-experimental decoy structures from docking program and the CSAR NRC-HiQ data set (a high-quality data set provided by CSAR), which showed great success. Thus, our study provides a simple but efficient scoring function for predicting protein-ligand binding free energy.

Protein-ligand binding affinity prediction model based on graph attention network

Estimating the binding affinity between proteins and drugs is very important in the application of structure-based drug design. Currently, applying machine learning to build the protein-ligand binding affinity prediction model, which is helpful to improve the performance of classical scoring functions, has attracted many scientists' attention. In this paper, we have developed an affinity prediction model called GAT-Score based on graph attention network (GAT). The protein-ligand complex is represented by a graph structure, and the atoms of protein and ligand are treated in the same manner. Two improvements are made to the original graph attention network. Firstly, a dynamic feature mechanism is designed to enable the model to deal with bond features. Secondly, a virtual super node is introduced to aggregate node-level features into graph-level features, so that the model can be used in the graph-level regression problems. PDBbind database v.2018 is used to train the model. Finally, the performance of GAT-Score was tested by the scheme $C_s$ (Core set as the test set) and CV (Cross-Validation). It has been found that our results are better than most methods from machine learning models with traditional molecular descriptors.

Lin_F9: A Linear Empirical Scoring Function for Protein-Ligand Docking

Molecular docking is one of the most widely used computational tools in structure-based drug design and is critically dependent on accuracy and robustness of the scoring function. In this work, we introduce a new scoring function Lin_F9, which is a linear combination of nine empirical terms, including a unified metal bond term to specifically describe metal-ligand interactions. Parameters in Lin_F9 are obtained with a multistage fitting protocol using explicit water-included structures. For the CASF-2016 benchmark test set, Lin_F9 achieves the top scoring power among all 34 classical scoring functions for both original crystal poses and locally optimized poses with Pearson correlation coefficients (R) of 0.680 and 0.687, respectively. Meanwhile, in comparison with Vina, Lin_F9 achieves consistently better scoring power and ranking power with various types of protein-ligand complex structures that mimic real docking applications, including end-to-end flexible docking for the CASF-2016 benchmark test set using a single or an ensemble of protein receptor structures, as well as for D3R Grand Challenge (GC4) test sets. Lin_F9 has been implemented in a fork of Smina as an optional built-in scoring function that can be used for docking applications as well as for further improvement of scoring functions and docking protocols. Lin_F9 is accessible through https://yzhang.hpc.nyu.edu/Lin_F9/.

Strengths and Weaknesses of Docking Simulations in the SARS-CoV-2 Era: the Main Protease (Mpro) Case Study

The scientific community is working against the clock to arrive at therapeutic interventions to treat patients with COVID-19. Among the strategies for drug discovery, virtual screening approaches have the capacity to search potential hits within millions of chemical structures in days, with the appropriate computing infrastructure. In this article, we first analyzed the published research targeting the inhibition of the main protease (Mpro), one of the most studied targets of SARS-CoV-2, by docking-based methods. An alarming finding was the lack of an adequate validation of the docking protocols (i.e., pose prediction and virtual screening accuracy) before applying them in virtual screening campaigns. The performance of the docking protocols was tested at some level in 57.7% of the 168 investigations analyzed. However, we found only three examples of a complete retrospective analysis of the scoring functions to quantify the virtual screening accuracy of the methods. Moreover, only two publications reported some experimental evaluation of the proposed hits until preparing this manuscript. All of these findings led us to carry out a retrospective performance validation of three different docking protocols, through the analysis of their pose prediction and screening accuracy. Surprisingly, we found that even though all tested docking protocols have a good pose prediction, their screening accuracy is quite limited as they fail to correctly rank a test set of compounds. These results highlight the importance of conducting an adequate validation of the docking protocols before carrying out virtual screening campaigns, and to experimentally confirm the predictions made by the models before drawing bold conclusions. Finally, successful structure-based drug discovery investigations published during the redaction of this manuscript allow us to propose the inclusion of target flexibility and consensus scoring as alternatives to improve the accuracy of the methods.

Multitask deep networks with grid featurization achieve improved scoring performance for protein-ligand binding

Deep learning-based methods have been extensively developed to improve scoring performance in structure-based drug discovery. Extending multitask deep networks in addressing pharmaceutical problems shows remarkable improvements over single task network. Recently, grid featurization has been introduced to convert protein-ligand complex co-ordinates into fingerprints with the advantage of incorporating inter- and intra-molecular information. The combination of grid featurization with multitask deep networks would hold great potential to boost the scoring performance. We examined the performance of three novel multitask deep networks (standard multitask, bypass, and progressive network) in reproducing the binding affinities of protein-ligand complexes in comparison with AutoDock Vina docking and MM/GBSA method. Among five evaluated methods, progressive network combined with grid featurization provided the best Pearson correlation coefficient (0.74) and least mean absolute average error (0.98) for the overall scoring performance. Moreover, all networks increased screening ability for the re-docking pose and progressive network even achieved AUC of 0.87 over 0.52 of AutoDock Vina. Our results demonstrated that progressive network combined with grid featurization would be one powerful rescoring approach to strengthen screening results after obtaining protein-ligand complex in the conventional docking software.

Extended connectivity interaction features: improving binding affinity prediction through chemical description

MOTIVATION

Machine-learning scoring functions (SFs) have been found to outperform standard SFs for binding affinity prediction of protein-ligand complexes. A plethora of reports focus on the implementation of increasingly complex algorithms, while the chemical description of the system has not been fully exploited.

RESULTS

Herein, we introduce Extended Connectivity Interaction Features (ECIF) to describe protein-ligand complexes and build machine-learning SFs with improved predictions of binding affinity. ECIF are a set of protein-ligand atom-type pair counts that take into account each atom's connectivity to describe it and thus define the pair types. ECIF were used to build different machine-learning models to predict protein-ligand affinities (pKd/pKi). The models were evaluated in terms of 'scoring power' on the Comparative Assessment of Scoring Functions 2016. The best models built on ECIF achieved Pearson correlation coefficients of 0.857 when used on its own, and 0.866 when used in combination with ligand descriptors, demonstrating ECIF descriptive power.

AVAILABILITY AND IMPLEMENTATION

Data and code to reproduce all the results are freely available at https://github.com/DIFACQUIM/ECIF.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

A comprehensive comparative assessment of 3D molecular similarity tools in ligand-based virtual screening

Three-dimensional (3D) molecular similarity, one major ligand-based virtual screening (VS) method, has been widely used in the drug discovery process. A variety of 3D molecular similarity tools have been developed in recent decades. In this study, we assessed a panel of 15 3D molecular similarity programs against the DUD-E and LIT-PCBA datasets, including commercial ROCS and Phase, in terms of screening power and scaffold-hopping power. The results revealed that (1) SHAFTS, LS-align, Phase Shape_Pharm and LIGSIFT showed the best VS capability in terms of screening power. Some 3D similarity tools available to academia can yield relatively better VS performance than commercial ROCS and Phase software. (2) Current 3D similarity VS tools exhibit a considerable ability to capture actives with new chemotypes in terms of scaffold hopping. (3) Multiple conformers relative to single conformations will generally improve VS performance for most 3D similarity tools, with marginal improvement observed in area under the receiving operator characteristic curve values, enrichment factor in the top 1% and hit rate in the top 1% values showed larger improvement. Moreover, redundancy and complementarity analyses of hit lists from different query seeds and different 3D similarity VS tools showed that the combination of different query seeds and/or different 3D similarity tools in VS campaigns retrieved more (and more diverse) active molecules. These findings provide useful information for guiding choices of the optimal 3D molecular similarity tools for VS practices and designing possible combination strategies to discover more diverse active compounds.

WADDAICA: A webserver for aiding protein drug design by artificial intelligence and classical algorithm

Artificial intelligence can train the related known drug data into deep learning models for drug design, while classical algorithms can design drugs through established and predefined procedures. Both deep learning and classical algorithms have their merits for drug design. Here, the webserver WADDAICA is built to employ the advantage of deep learning model and classical algorithms for drug design. The WADDAICA mainly contains two modules. In the first module, WADDAICA provides deep learning models for scaffold hopping of compounds to modify or design new novel drugs. The deep learning model which is used in WADDAICA shows a good scoring power based on the PDBbind database. In the second module, WADDAICA supplies functions for modifying or designing new novel drugs by classical algorithms. WADDAICA shows better Pearson and Spearman correlations of binding affinity than Autodock Vina that is considered to have the best scoring power. Besides, WADDAICA supplies a friendly and convenient web interface for users to submit drug design jobs. We believe that WADDAICA is a useful and effective tool to help researchers to modify or design novel drugs by deep learning models and classical algorithms. WADDAICA is free and accessible at https://bqflab.github.io or https://heisenberg.ucam.edu:5000.

KORP-PL: a coarse-grained knowledge-based scoring function for protein-ligand interactions

MOTIVATION

Despite the progress made in studying protein-ligand interactions and the widespread application of docking and affinity prediction tools, improving their precision and efficiency still remains a challenge. Computational approaches based on the scoring of docking conformations with statistical potentials constitute a popular alternative to more accurate but costly physics-based thermodynamic sampling methods. In this context, a minimalist and fast sidechain-free knowledge-based potential with a high docking and screening power can be very useful when screening a big number of putative docking conformations.

RESULTS

Here, we present a novel coarse-grained potential defined by a 3D joint probability distribution function that only depends on the pairwise orientation and position between protein backbone and ligand atoms. Despite its extreme simplicity, our approach yields very competitive results with the state-of-the-art scoring functions, especially in docking and screening tasks. For example, we observed a twofold improvement in the median 5% enrichment factor on the DUD-E benchmark compared to Autodock Vina results. Moreover, our results prove that a coarse sidechain-free potential is sufficient for a very successful docking pose prediction.

AVAILABILITYAND IMPLEMENTATION

The standalone version of KORP-PL with the corresponding tests and benchmarks are available at https://team.inria.fr/nano-d/korp-pl/ and https://chaconlab.org/modeling/korp-pl.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

ET-score: Improving Protein-ligand Binding Affinity Prediction Based on Distance-weighted Interatomic Contact Features Using Extremely Randomized Trees Algorithm

The molecular docking simulation is a key computational tool in modern drug discovery research that its predictive performance strongly depends on the employed scoring functions. Many recent studies have shown that the application of machine learning algorithms in the development of scoring functions has led to a significant improvement in docking performance. In this work, we introduce a new machine learning (ML) based scoring function called ET-Score, which employs the distance-weighted interatomic contacts between atom type pairs of the ligand and the protein for featurizing protein-ligand complexes and Extremely Randomized Trees algorithm for the training process. The performance of ET-Score is compared with some successful ML-based scoring functions and several popular classical scoring functions on the PDBbind 2016v core set. It is shown that our ET-Score model (with Pearson's correlation of 0.827 and RMSE of 1.332) achieves very good performance in comparison with most of the ML-based scoring functions and all classical scoring functions despite its extremely low computational cost. ET-Score's codes are freely available on the web at https://github.com/miladrayka/ET_Score.

Machine learning on ligand-residue interaction profiles to significantly improve binding affinity prediction

Structure-based virtual screenings (SBVSs) play an important role in drug discovery projects. However, it is still a challenge to accurately predict the binding affinity of an arbitrary molecule binds to a drug target and prioritize top ligands from an SBVS. In this study, we developed a novel method, using ligand-residue interaction profiles (IPs) to construct machine learning (ML)-based prediction models, to significantly improve the screening performance in SBVSs. Such a kind of the prediction model is called an IP scoring function (IP-SF). We systematically investigated how to improve the performance of IP-SFs from many perspectives, including the sampling methods before interaction energy calculation and different ML algorithms. Using six drug targets with each having hundreds of known ligands, we conducted a critical evaluation on the developed IP-SFs. The IP-SFs employing a gradient boosting decision tree (GBDT) algorithm in conjunction with the MIN + GB simulation protocol achieved the best overall performance. Its scoring power, ranking power and screening power significantly outperformed the Glide SF. First, compared with Glide, the average values of mean absolute error and root mean square error of GBDT/MIN + GB decreased about 38 and 36%, respectively. Second, the mean values of squared correlation coefficient and predictive index increased about 225 and 73%, respectively. Third, more encouragingly, the average value of the areas under the curve of receiver operating characteristic for six targets by GBDT, 0.87, is significantly better than that by Glide, which is only 0.71. Thus, we expected IP-SFs to have broad and promising applications in SBVSs.

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

There has recently been a rapid progress in computational methods for determining protein targets of small molecule drugs, which will be termed as compound protein interaction (CPI). In this review, we comprehensively review topics related to computational prediction of CPI. Data for CPI has been accumulated and curated significantly both in quantity and quality. Computational methods have become powerful ever to analyze such complex the data. Thus, recent successes in the improved quality of CPI prediction are due to use of both sophisticated computational techniques and higher quality information in the databases. The goal of this article is to provide reviews of topics related to CPI, such as data, format, representation, to computational models, so that researchers can take full advantages of these resources to develop novel prediction methods. Chemical compounds and protein data from various resources were discussed in terms of data formats and encoding schemes. For the CPI methods, we grouped prediction methods into five categories from traditional machine learning techniques to state-of-the-art deep learning techniques. In closing, we discussed emerging machine learning topics to help both experimental and computational scientists leverage the current knowledge and strategies to develop more powerful and accurate CPI prediction methods.

New machine learning and physics-based scoring functions for drug discovery

Scoring functions are essential for modern in silico drug discovery. However, the accurate prediction of binding affinity by scoring functions remains a challenging task. The performance of scoring functions is very heterogeneous across different target classes. Scoring functions based on precise physics-based descriptors better representing protein–ligand recognition process are strongly needed. We developed a set of new empirical scoring functions, named DockTScore, by explicitly accounting for physics-based terms combined with machine learning. Target-specific scoring functions were developed for two important drug targets, proteases and protein–protein interactions, representing an original class of molecules for drug discovery. Multiple linear regression (MLR), support vector machine and random forest algorithms were employed to derive general and target-specific scoring functions involving optimized MMFF94S force-field terms, solvation and lipophilic interactions terms, and an improved term accounting for ligand torsional entropy contribution to ligand binding. DockTScore scoring functions demonstrated to be competitive with the current best-evaluated scoring functions in terms of binding energy prediction and ranking on four DUD-E datasets and will be useful for in silico drug design for diverse proteins as well as for specific targets such as proteases and protein–protein interactions. Currently, the MLR DockTScore is available at www.dockthor.lncc.br.

A Study on the Mechanism of Milkvetch Root in the Treatment of Diabetic Nephropathy Based on Network Pharmacology

Diabetic nephropathy (DN) is one of the most common complications of diabetes mellitus. Owing to its complicated pathogenesis, no satisfactory treatment strategies for DN are available. Milkvetch Root is a common traditional Chinese medicine (TCM) and has been extensively used to treat DN in clinical practice in China for many years. However, due to the complexity of botanical ingredients, the exact pharmacological mechanism of Milkvetch Root in treating DN has not been completely elucidated. The aim of this study was to explore the active components and potential mechanism of Milkvetch Root by using a systems pharmacology approach. First, the components and targets of Milkvetch Root were analyzed by using the Traditional Chinese Medicine Systems Pharmacology database. We found the common targets of Milkvetch Root and DN constructed a protein-protein interaction (PPI) network using STRING and screened the key targets via topological analysis. Enrichment of Gene Ontology (GO) pathways and Kyoto Encyclopedia of Genes and Genomes (KEGG) pathways were analyzed. Subsequently, major hubs were identified and imported to the Database for Annotation, Visualization and Integrated Discovery for pathway enrichment analysis. The binding activity and targets of the active components of Milkvetch Root were verified by using the molecular docking software SYBYL. Finally, we found 20 active components in Milkvetch Root. Moreover, the enrichment analysis of GO and KEGG pathways suggested that AGE-RAGE signaling pathway, HIF-1 signaling pathway, PI3K-Akt signaling pathway, and TNF signaling pathway might be the key pathways for the treatment of DN; more importantly, 10 putative targets of Milkvetch Root (AKT1, VEGFA, IL-6, PPARG, CCL2, NOS3, SERPINE1, CRP, ICAM1, and SLC2A) were identified to be of great significance in regulating these biological processes and pathways. This study provides an important scientific basis for further elucidating the mechanism of Milkvetch Root in treating DN.

Assessing multiple score functions in Rosetta for drug discovery

Rosetta is a computational software suite containing algorithms for a wide variety of macromolecular structure prediction and design tasks including small molecule protocols commonly used in drug discovery or enzyme design. Here, we benchmark RosettaLigand score functions and protocols in comparison to results of other software recently published in the Comparative Assessment of Score Functions (CASF-2016). The CASF-2016 benchmark covers a wide variety of tests including scoring and ranking multiple compounds against a target, ligand docking of a small molecule to a target, and virtual screening to extract binders from a compound library. Direct comparison to the score functions provided by CASF-2016 results shows that the original RosettaLigand score function ranks among the top software for scoring, ranking, docking and screening tests. Most notably, the RosettaLigand score function ranked 2/34 among other report score functions in CASF-2016. We additionally perform a ligand docking test with full sampling to mimic typical use cases. Despite improved performance of newer score functions in canonical protein structure prediction and design, we demonstrate here that more recent Rosetta score functions have reduced performance across all small molecule benchmarks. The tests described here have also been uploaded to the Rosetta scientific benchmarking server and will be run weekly to track performance as the code is continually being developed.