GeauxDock: Accelerating Structure-Based Virtual Screening with Heterogeneous Computing

Recent advances in computational and experimental protein-ligand affinity determination techniques

INTRODUCTION

Modern drug discovery revolves around designing ligands that target the chosen biomolecule, typically proteins. For this, the evaluation of affinities of putative ligands is crucial. This has given rise to a multitude of dedicated computational and experimental methods that are constantly being developed and improved.

AREAS COVERED

In this review, the authors reassess both the industry mainstays and the newest trends among the methods for protein - small-molecule affinity determination. They discuss both computational affinity predictions and experimental techniques, describing their basic principles, main limitations, and advantages. Together, this serves as initial guide to the currently most popular and cutting-edge ligand-binding assays employed in rational drug design.

EXPERT OPINION

The affinity determination methods continue to develop toward miniaturization, high-throughput, and in-cell application. Moreover, the availability of data analysis tools has been constantly increasing. Nevertheless, cross-verification of data using at least two different techniques and careful result interpretation remain of utmost importance.

Applying molecular docking to pesticides

Pesticide creation is related to the development of sustainable agricultural and ecological safety, and molecular docking technology can effectively help in pesticide innovation. This paper introduces the basic theory behind molecular docking, pesticide databases, and docking software. It also summarizes the application of molecular docking in the pesticide field, including the virtual screening of lead compounds, detection of pesticides and their metabolites in the environment, reverse screening of pesticide targets, and the study of resistance mechanisms. Finally, problems with the use of molecular docking technology in pesticide creation are discussed, and prospects for the future use of molecular docking technology in new pesticide development are discussed. © 2023 Society of Chemical Industry.

Deep Learning Model for Efficient Protein-Ligand Docking with Implicit Side-Chain Flexibility

Protein-ligand docking is an essential tool in structure-based drug design with applications ranging from virtual high-throughput screening to pose prediction for lead optimization. Most docking programs for pose prediction are optimized for redocking to an existing cocrystallized protein structure, ignoring protein flexibility. In real-world drug design applications, however, protein flexibility is an essential feature of the ligand-binding process. Flexible protein-ligand docking still remains a significant challenge to computational drug design. To target this challenge, we present a deep learning (DL) model for flexible protein-ligand docking based on the prediction of an intermolecular Euclidean distance matrix (EDM), making the typical use of iterative search algorithms obsolete. The model was trained on a large-scale data set of protein-ligand complexes and evaluated on independent test sets. Our model generates high quality poses for a diverse set of protein and ligand structures and outperforms comparable docking methods.

Validation of Deep Learning-Based DFCNN in Extremely Large-Scale Virtual Screening and Application in Trypsin I Protease Inhibitor Discovery

Computational methods with affordable computational resources are highly desirable for identifying active drug leads from millions of compounds. This requires a model that is both highly efficient and relatively accurate, which cannot be achieved by most of the current methods. In real virtual screening (VS) application scenarios, the desired method should perform much better in selecting active compounds by prediction than by random chance. Here, we systematically evaluate the performance of our previously developed DFCNN model in large-scale virtual screening, and the results show our method has approximately 22 times the success rate compared to the random chance on average with a score cutoff of 0.99. Of the 102 test cases, 10 cases have more than 98 times the success rate of a random guess. Interestingly, in three cases, the prediction success rate is 99 times that of a random guess by a score cutoff of 0.99. This indicates that in most situations after our extremely large-scale VS, the dataset can be reduced 20 to 100 times for the next step of virtual screening based on docking or MD simulation. Furthermore, we have employed an experimental method to verify our computational method by finding several activity inhibitors for Trypsin I Protease. In addition, we also show its proof-of-concept application in de novo drug screening. The results indicate the massive potential of this method in the first step of the real drug development workflow. Moreover, DFCNN only takes about 0.0000225s for one protein–compound prediction on average with 80 Intel CPU cores (2.00 GHz) and 60 GB RAM, which is at least tens of thousands of times faster than AutoDock Vina or Schrödinger high-throughput virtual screening. Additionally, an online webserver based on DFCNN for large-scale screening is available at http://cbblab.siat.ac.cn/DFCNN/index.php for the convenience of the users.

A Review on Parallel Virtual Screening Softwares for High-Performance Computers

Drug discovery is the most expensive, time-demanding, and challenging project in biopharmaceutical companies which aims at the identification and optimization of lead compounds from large-sized chemical libraries. The lead compounds should have high-affinity binding and specificity for a target associated with a disease, and, in addition, they should have favorable pharmacodynamic and pharmacokinetic properties (grouped as ADMET properties). Overall, drug discovery is a multivariable optimization and can be carried out in supercomputers using a reliable scoring function which is a measure of binding affinity or inhibition potential of the drug-like compound. The major problem is that the number of compounds in the chemical spaces is huge, making the computational drug discovery very demanding. However, it is cheaper and less time-consuming when compared to experimental high-throughput screening. As the problem is to find the most stable (global) minima for numerous protein-ligand complexes (on the order of 106 to 1012), the parallel implementation of in silico virtual screening can be exploited to ensure drug discovery in affordable time. In this review, we discuss such implementations of parallelization algorithms in virtual screening programs. The nature of different scoring functions and search algorithms are discussed, together with a performance analysis of several docking softwares ported on high-performance computing architectures.

Fine tuning for success in structure-based virtual screening

Structure-based virtual screening plays a significant role in drug-discovery. The method virtually docks millions of compounds from corporate or public libraries into a binding site of a disease-related protein structure, allowing for the selection of a small list of potential ligands for experimental testing. Many algorithms are available for docking and assessing the affinity of compounds for a targeted protein site. The performance of affinity estimation calculations is highly dependent on the size and nature of the site, therefore a rationale for selecting the best protocol is required. To address this issue, we have developed an automated calibration process, implemented in a Knime workflow. It consists of four steps: preparation of a protein test set with structures and models of the target, preparation of a compound test set with target-related ligands and decoys, automatic test of 24 scoring/rescoring protocols for each target structure and model, and graphical display of results. The automation of the process combined with execution on high performance computing resources greatly reduces the duration of the calibration phase, and the test of many combinations of algorithms on various target conformations results in a rational and optimal choice of the best protocol. Here, we present this tool and exemplify its application in setting-up an optimal protocol for SBVS against Retinoid X Receptor alpha.

Artificial intelligence to deep learning: machine intelligence approach for drug discovery

Drug designing and development is an important area of research for pharmaceutical companies and chemical scientists. However, low efficacy, off-target delivery, time consumption, and high cost impose a hurdle and challenges that impact drug design and discovery. Further, complex and big data from genomics, proteomics, microarray data, and clinical trials also impose an obstacle in the drug discovery pipeline. Artificial intelligence and machine learning technology play a crucial role in drug discovery and development. In other words, artificial neural networks and deep learning algorithms have modernized the area. Machine learning and deep learning algorithms have been implemented in several drug discovery processes such as peptide synthesis, structure-based virtual screening, ligand-based virtual screening, toxicity prediction, drug monitoring and release, pharmacophore modeling, quantitative structure-activity relationship, drug repositioning, polypharmacology, and physiochemical activity. Evidence from the past strengthens the implementation of artificial intelligence and deep learning in this field. Moreover, novel data mining, curation, and management techniques provided critical support to recently developed modeling algorithms. In summary, artificial intelligence and deep learning advancements provide an excellent opportunity for rational drug design and discovery process, which will eventually impact mankind. The primary concern associated with drug design and development is time consumption and production cost. Further, inefficiency, inaccurate target delivery, and inappropriate dosage are other hurdles that inhibit the process of drug delivery and development. With advancements in technology, computer-aided drug design integrating artificial intelligence algorithms can eliminate the challenges and hurdles of traditional drug design and development. Artificial intelligence is referred to as superset comprising machine learning, whereas machine learning comprises supervised learning, unsupervised learning, and reinforcement learning. Further, deep learning, a subset of machine learning, has been extensively implemented in drug design and development. The artificial neural network, deep neural network, support vector machines, classification and regression, generative adversarial networks, symbolic learning, and meta-learning are examples of the algorithms applied to the drug design and discovery process. Artificial intelligence has been applied to different areas of drug design and development process, such as from peptide synthesis to molecule design, virtual screening to molecular docking, quantitative structure-activity relationship to drug repositioning, protein misfolding to protein-protein interactions, and molecular pathway identification to polypharmacology. Artificial intelligence principles have been applied to the classification of active and inactive, monitoring drug release, pre-clinical and clinical development, primary and secondary drug screening, biomarker development, pharmaceutical manufacturing, bioactivity identification and physiochemical properties, prediction of toxicity, and identification of mode of action.

Structure-Based Virtual Screening: From Classical to Artificial Intelligence

The drug development process is a major challenge in the pharmaceutical industry since it takes a substantial amount of time and money to move through all the phases of developing of a new drug. One extensively used method to minimize the cost and time for the drug development process is computer-aided drug design (CADD). CADD allows better focusing on experiments, which can reduce the time and cost involved in researching new drugs. In this context, structure-based virtual screening (SBVS) is robust and useful and is one of the most promising in silico techniques for drug design. SBVS attempts to predict the best interaction mode between two molecules to form a stable complex, and it uses scoring functions to estimate the force of non-covalent interactions between a ligand and molecular target. Thus, scoring functions are the main reason for the success or failure of SBVS software. Many software programs are used to perform SBVS, and since they use different algorithms, it is possible to obtain different results from different software using the same input. In the last decade, a new technique of SBVS called consensus virtual screening (CVS) has been used in some studies to increase the accuracy of SBVS and to reduce the false positives obtained in these experiments. An indispensable condition to be able to utilize SBVS is the availability of a 3D structure of the target protein. Some virtual databases, such as the Protein Data Bank, have been created to store the 3D structures of molecules. However, sometimes it is not possible to experimentally obtain the 3D structure. In this situation, the homology modeling methodology allows the prediction of the 3D structure of a protein from its amino acid sequence. This review presents an overview of the challenges involved in the use of CADD to perform SBVS, the areas where CADD tools support SBVS, a comparison between the most commonly used tools, and the techniques currently used in an attempt to reduce the time and cost in the drug development process. Finally, the final considerations demonstrate the importance of using SBVS in the drug development process.

Molecular Architect: A User-Friendly Workflow for Virtual Screening

Computer-assisted drug design (CADD) methods have greatly contributed to the development of new drugs. Among CADD methodologies, virtual screening (VS) can enrich the compound collection with molecules that have the desired physicochemical and pharmacophoric characteristics that are needed to become drugs. Many free tools are available for this purpose, but they are difficult to use and do not have a graphical user interface. Furthermore, several free tools must be used to carry out the entire VS process, requiring the user to process the results of one software program so that they can be used in another program, adding a potential source of human error. Moreover, some software programs require knowledge of advanced computational skills, such as programming languages. This context has motivated us to develop Molecular Architect (MolAr). MolAr is a workflow with a simple and intuitive interface that acts in an integrated and automated form to perform the entire VS process, from protein preparation (homology modeling and protonation state) to virtual screening. MolAr carries out VS through AutoDock Vina, DOCK 6, or a consensus of the two. Two case studies were conducted to demonstrate the performance of MolAr. In the first study, the feasibility of using MolAr for DNA-ligand systems was assessed. Both AutoDock Vina and DOCK 6 showed good results in performing VS in DNA-ligand systems. However, the use of consensus virtual screening was able to enrich the results. According to the area under the ROC curve and the enrichment factors, consensus VS was better able to predict the positions of the active ligands. The second case study was performed on 8 targets from the DUD-E database and 10 active ligands for each target. The results demonstrated that using the final ligand conformation provided by AutoDock Vina as an input for DOCK 6 improved the DOCK 6 ROC curves by up to 42% in VS. These case studies demonstrated that MolAr is capable conducting the VS process and is an easy-to-use and effective tool. MolAr is available for download free of charge at http: //www.drugdiscovery.com.br/software/.

Combining Docking Pose Rank and Structure with Deep Learning Improves Protein-Ligand Binding Mode Prediction over a Baseline Docking Approach

We present a simple, modular graph-based convolutional neural network that takes structural information from protein-ligand complexes as input to generate models for activity and binding mode prediction. Complex structures are generated by a standard docking procedure and fed into a dual-graph architecture that includes separate subnetworks for the ligand bonded topology and the ligand-protein contact map. Recent work has indicated that data set bias drives many past promising results derived from combining deep learning and docking. Our dual-graph network allows contributions from ligand identity that give rise to such biases to be distinguished from effects of protein-ligand interactions on classification. We show that our neural network is capable of learning from protein structural information when, as in the case of binding mode prediction, an unbiased data set is constructed. We next develop a deep learning model for binding mode prediction that uses docking ranking as input in combination with docking structures. This strategy mirrors past consensus models and outperforms a baseline docking program (AutoDock Vina) in a variety of tests, including on cross-docking data sets that mimic real-world docking use cases. Furthermore, the magnitudes of network predictions serve as reliable measures of model confidence.

Advances in distributed computing with modern drug discovery

INTRODUCTION

Computational chemistry dramatically accelerates the drug discovery process and high-performance computing (HPC) can be used to speed up the most expensive calculations. Supporting a local HPC infrastructure is both costly and time-consuming, and, therefore, many research groups are moving from in-house solutions to remote-distributed computing platforms. Areas covered: The authors focus on the use of distributed technologies, solutions, and infrastructures to gain access to HPC capabilities, software tools, and datasets to run the complex simulations required in computational drug discovery (CDD). Expert opinion: The use of computational tools can decrease the time to market of new drugs. HPC has a crucial role in handling the complex algorithms and large volumes of data required to achieve specificity and avoid undesirable side-effects. Distributed computing environments have clear advantages over in-house solutions in terms of cost and sustainability. The use of infrastructures relying on virtualization reduces set-up costs. Distributed computing resources can be difficult to access, although web-based solutions are becoming increasingly available. There is a trade-off between cost-effectiveness and accessibility in using on-demand computing resources rather than free/academic resources. Graphics processing unit computing, with its outstanding parallel computing power, is becoming increasingly important.

The application of molecular topology for ulcerative colitis drug discovery

INTRODUCTION

Although the therapeutic arsenal against ulcerative colitis has greatly expanded (including the revolutionary advent of biologics), there remain patients who are refractory to current medications while the safety of the available therapeutics could also be improved. Molecular topology provides a theoretic framework for the discovery of new therapeutic agents in a very efficient manner, and its applications in the field of ulcerative colitis have slowly begun to flourish. Areas covered: After discussing the basics of molecular topology, the authors review QSAR models focusing on validated targets for the treatment of ulcerative colitis, entirely or partially based on topological descriptors. Expert opinion: The application of molecular topology to ulcerative colitis drug discovery is still very limited, and many of the existing reports seem to be strictly theoretic, with no experimental validation or practical applications. Interestingly, mechanism-independent models based on phenotypic responses have recently been reported. Such models are in agreement with the recent interest raised by network pharmacology as a potential solution for complex disorders. These and other similar studies applying molecular topology suggest that some therapeutic categories may present a 'topological pattern' that goes beyond a specific mechanism of action.

Aromatic interactions at the ligand-protein interface: Implications for the development of docking scoring functions

The ability to design and fine-tune non-covalent interactions between organic ligands and proteins is indispensable to rational drug development. Aromatic stacking has long been recognized as one of the key constituents of ligand-protein interfaces. In this communication, we employ a two-parameter geometric model to conduct a large-scale statistical analysis of aromatic contacts in the experimental and computer-generated structures of ligand-protein complexes, considering various combinations of aromatic amino acid residues and ligand rings. The geometry of interfacial π-π stacking in crystal structures accords with experimental and theoretical data collected for simple systems, such as the benzene dimer. Many contemporary ligand docking programs implicitly treat aromatic stacking with van der Waals and Coulombic potentials. Although this approach generally provides a sufficient specificity to model aromatic interactions, the geometry of π-π contacts in high-scoring docking conformations could still be improved. The comprehensive analysis of aromatic geometries at ligand-protein interfaces lies the foundation for the development of type-specific statistical potentials to more accurately describe aromatic interactions in molecular docking. A Perl script to detect and calculate the geometric parameters of aromatic interactions in ligand-protein complexes is available at https://github.com/michal-brylinski/earomatic. The dataset comprising experimental complex structures and computer-generated models is available at https://osf.io/rztha/.