Significant enhancement of docking sensitivity using implicit ligand sampling

The efficient and accurate quantification of protein-ligand interactions using computational methods is still a challenging task. Two factors strongly contribute to the failure of docking methods to predict free energies of binding accurately: the insufficient incorporation of protein flexibility coupled to ligand binding and the neglected dynamics of the protein-ligand complex in current scoring schemes. We have developed a new methodology, named the 'ligand-model' concept, to sample protein conformations that are relevant for binding structurally diverse sets of ligands. In the ligand-model concept, molecular-dynamics (MD) simulations are performed with a virtual ligand, represented by a collection of functional groups that binds to the protein and dynamically changes its shape and properties during the simulation. The ligand model essentially represents a large ensemble of different chemical species binding to the same target protein. Representative protein structures were obtained from the MD simulation, and docking was performed into this ensemble of protein conformation. Similar binding poses were clustered, and the averaged score was utilized to rerank the poses. We demonstrate that the ligand-model approach yields significant improvements in predicting native-like binding poses and quantifying binding affinities compared to static docking and ensemble docking simulations into protein structures generated from an apo MD simulation.     

Rapid protein-ligand costructures using chemical shift perturbations

Structure-based drug discovery requires the iterative determination of protein-ligand costructures in order to improve the binding affinity and selectivity of potential drug candidates. In general, X-ray and NMR structure determination methods are time consuming and are typically the limiting factor in the drug discovery process. The application of molecular docking simulations to filter and evaluate drug candidates has become a common method to improve the throughput and efficiency of structure-based drug design. Unfortunately, molecular docking methods suffer from common problems that include ambiguous ligand conformers or failure to predict the correct docked structure. A rapid approach to determine accurate protein-ligand costructures is described based on NMR chemical shift perturbation (CSP) data routinely obtained using 2D 1H-15N HSQC spectra in high-throughput ligand affinity screens. The CSP data is used to both guide and filter AutoDock calculations using our AutoDockFilter program. This method is demonstrated for 19 distinct protein-ligand complexes where the docked conformers exhibited an average rmsd of 1.17 +/- 0.74 A relative to the original X-ray structures for the protein-ligand complexes.     

Comparison of Accuracy and Convergence Rate between Equilibrium and Nonequilibrium Alchemical Transformations for Calculation of Relative Binding Free Energy

Estimation of protein-ligand binding affinity within chemical accuracy is one of the grand challenges in structure-based rational drug design. With the efforts over three decades, free energy methods based on equilibrium molecular dynamics (MD) simulations have become mature and are nowadays routinely applied in the community of computational chemistry. On the contrary, nonequilibrium MD simulation methods have attracted less attention, despite their underlying rigor in mathematics and potential advantage in efficiency. In this work, the equilibrium and nonequilibrium simulation methods are compared in terms of accuracy and convergence rate in the calculations of relative binding free energies. The proteins studied are T4-lysozyme mutant L99A and COX-2. For each protein, two ligands are studied. The results show that the nonequilibrium simulation method can be competitively as accurate as the equilibrium method, and the former is more efficient than the latter by considering the convergence rate with respect to the cost of wall clock time. In addition, Bennett acceptance ratio, which is a bidirectional post-processing method, converges faster than the unidirectional Jarzynski equality for the nonequilibrium simulations.     

Computer-aided drug design platform using PyMOL

The understanding and optimization of protein-ligand interactions are instrumental to medicinal chemists investigating potential drug candidates. Over the past couple of decades, many powerful standalone tools for computer-aided drug discovery have been developed in academia providing insight into protein-ligand interactions. As programs are developed by various research groups, a consistent user-friendly graphical working environment combining computational techniques such as docking, scoring, molecular dynamics simulations, and free energy calculations is needed. Utilizing PyMOL we have developed such a graphical user interface incorporating individual academic packages designed for protein preparation (AMBER package and Reduce), molecular mechanics applications (AMBER package), and docking and scoring (AutoDock Vina and SLIDE). In addition to amassing several computational tools under one interface, the computational platform also provides a user-friendly combination of different programs. For example, utilizing a molecular dynamics (MD) simulation performed with AMBER as input for ensemble docking with AutoDock Vina. The overarching goal of this work was to provide a computational platform that facilitates medicinal chemists, many who are not experts in computational methodologies, to utilize several common computational techniques germane to drug discovery. Furthermore, our software is open source and is aimed to initiate collaborative efforts among computational researchers to combine other open source computational methods under a single, easily understandable graphical user interface.     

Supervised consensus scoring for docking and virtual screening

Docking programs are widely used to discover novel ligands efficiently and can predict protein-ligand complex structures with reasonable accuracy and speed. However, there is an emerging demand for better performance from the scoring methods. Consensus scoring (CS) methods improve the performance by compensating for the deficiencies of each scoring function. However, conventional CS and existing scoring functions have the same problems, such as a lack of protein flexibility, inadequate treatment of salvation, and the simplistic nature of the energy function used. Although there are many problems in current scoring functions, we focus our attention on the incorporation of unbound ligand conformations. To address this problem, we propose supervised consensus scoring (SCS), which takes into account protein-ligand binding process using unbound ligand conformations with supervised learning. An evaluation of docking accuracy for 100 diverse protein-ligand complexes shows that SCS outperforms both CS and 11 scoring functions (PLP, F-Score, LigScore, DrugScore, LUDI, X-Score, AutoDock, PMF, G-Score, ChemScore, and D-score). The success rates of SCS range from 89% to 91% in the range of rmsd < 2 A, while those of CS range from 80% to 85%, and those of the scoring functions range from 26% to 76%. Moreover, we also introduce a method for judging whether a compound is active or inactive with the appropriate criterion for virtual screening. SCS performs quite well in docking accuracy and is presumably useful for screening large-scale compound databases before predicting binding affinity.     

Solvent interaction energy calculations on molecular dynamics trajectories: increasing the efficiency using systematic frame selection

End-point methods such as linear interaction energy (LIE) analysis, molecular mechanics generalized Born solvent-accessible surface (MM/GBSA), and solvent interaction energy (SIE) analysis have become popular techniques to calculate the free energy associated with protein-ligand binding. Such methods typically use molecular dynamics (MD) simulations to generate an ensemble of protein structures that encompasses the bound and unbound states. The energy evaluation method (LIE, MM/GBSA, or SIE) is subsequently used to calculate the energy of each member of the ensemble, thus providing an estimate of the average free energy difference between the bound and unbound states. The workflow requiring both MD simulation and energy calculation for each frame and each trajectory proves to be computationally expensive. In an attempt to reduce the high computational cost associated with end-point methods, we study several methods by which frames may be intelligently selected from the MD simulation including clustering and address the question of how the number of selected frames influences the accuracy of the SIE calculations.     

Taba: A Tool to Analyze the Binding Affinity

Evaluation of ligand-binding affinity using the atomic coordinates of a protein-ligand complex is a challenge from the computational point of view. The availability of crystallographic structures of complexes with binding affinity data opens the possibility to create machine-learning models targeted to a specific protein system. Here, we describe a new methodology that combines a mass-spring system approach with supervised machine-learning techniques to predict the binding affinity of protein-ligand complexes. The combination of these techniques allows exploring the scoring function space, generating a model targeted to a protein system of interest. The new model shows superior predictive performance when compared with classical scoring functions implemented in the programs Molegro Virtual Docker, AutoDock4, and AutoDock Vina. We implemented this methodology in a new program named Taba. Taba is implemented in Python and available to download under the GNU license at https://github.com/azevedolab/taba . © 2019 Wiley Periodicals, Inc.     

A semiempirical free energy force field with charge-based desolvation

The authors describe the development and testing of a semiempirical free energy force field for use in AutoDock4 and similar grid-based docking methods. The force field is based on a comprehensive thermodynamic model that allows incorporation of intramolecular energies into the predicted free energy of binding. It also incorporates a charge-based method for evaluation of desolvation designed to use a typical set of atom types. The method has been calibrated on a set of 188 diverse protein-ligand complexes of known structure and binding energy, and tested on a set of 100 complexes of ligands with retroviral proteases. The force field shows improvement in redocking simulations over the previous AutoDock3 force field.     

Ligand Binding and Release Investigated by Contact-Guided Iterative Multiple Independent Molecular Dynamics Simulations

Binding and releasing ligands are critical for the biological functions of many proteins, so it is important to determine these highly dynamic processes. Although there are experimental techniques to determine the structure of a protein-ligand complex, it only provides a static picture of the system. With the rapid increase of computing power and improved algorithms, molecular dynamics (MD) simulations have diverse of superiority in probing the binding and release process. However, it remains a great challenge to overcome the time and length scales when the system becomes large. This work presents an enhanced sampling tool for ligand binding and release, which is based on iterative multiple independent MD simulations guided by contacts formed between the ligand and the protein. From the simulation results on adenylate kinase, we observe the process of ligand binding and release while the conventional MD simulations at the same time scale cannot.     

Steered molecular dynamics simulations of protein-ligand interactions

Molecular recognition and specific protein-ligandinteractions are central to many biochemical processes,such as enzyme catalysis, assembly of organelles, en-ergy transduction, signaling, diverse control functions,and replication, expression and storage of the geneticmaterial[1]. Moreover, protein-ligand interactions pro-vide the mechanism of many drug therapies and un-derstanding of such interactions is thus significant forrational drug design[1,2]. For the experimental studiesof protein-ligan…     

A D3R prospective evaluation of machine learning for protein-ligand scoring

We assess the performance of several machine learning-based scoring methods at protein-ligand pose prediction, virtual screening, and binding affinity prediction. The methods and the manner in which they were trained make them sufficiently diverse to evaluate the utility of various strategies for training set curation and binding pose generation, but they share a novel approach to classification in the context of protein-ligand scoring. Rather than explicitly using structural data such as affinity values or information extracted from crystal binding poses for training, we instead exploit the abundance of data available from high-throughput screening to approach the problem as one of discriminating binders from non-binders. We evaluate the performance of our various scoring methods in the 2015 D3R Grand Challenge and find that although the merits of some features of our approach remain inconclusive, our scoring methods performed comparably to a state-of-the-art scoring function that was fit to binding affinity data.     

The MPSim-Dock hierarchical docking algorithm: application to the eight trypsin inhibitor cocrystals

To help improve the accuracy of protein-ligand docking as a useful tool for drug discovery, we developed MPSim-Dock, which ensures a comprehensive sampling of diverse families of ligand conformations in the binding region followed by an enrichment of the good energy scoring families so that the energy scores of the sampled conformations can be reliably used to select the best conformation of the ligand. This combines elements of DOCK4.0 with molecular dynamics (MD) methods available in the software, MPSim. We test here the efficacy of MPSim-Dock to predict the 64 protein-ligand combinations formed by starting with eight trypsin cocrystals, and crossdocking the other seven ligands to each protein conformation. We consider this as a model for how well the method would work for one given target protein structure. Using as a criterion that the structures within 2 kcal/mol of the top scoring include a conformation within a coordinate root mean square (CRMS) of 1 A of the crystal structure, we find that 100% of the 64 cases are predicted correctly. This indicates that MPSim-Dock can be used reliably to identify strongly binding ligands, making it useful for virtual ligand screening.     

Alternative to consensus scoring--a new approach toward the qualitative combination of docking algorithms

Since the development of the first docking algorithm in the early 1980s a variety of different docking approaches and tools has been created in order to solve the docking problem. Subsequent studies have shown that the docking performance of most tools strongly depends on the considered target. Thus it is hard to choose the best algorithm in the situation at hand. The docking tools FlexX and AutoDock are among the most popular programs for docking flexible ligands into target proteins. Their analysis, comparison, and combination are the topics of this study. In contrast to standard consensus scoring techniques which integrate different scoring algorithms usually only by their rank, we focus on a more general approach. Our new combined docking workflow-AutoxX-unifies the interaction models of AutoDock and FlexX rather than combining the scores afterward which allows interpretability of the results. The performance of FlexX, AutoDock, and the combined algorithm AutoxX was evaluated on the basis of a test set of 204 structures from the Protein Data Bank (PDB). AutoDock and FlexX show a highly diverse redocking accuracy at the different complexes which assures again the usefulness of taking several docking algorithms into account. With the combined docking the number of complexes reproduced below an rmsd of 2.5 A could be raised by 10. AutoxX had a strong positive effect on several targets. The highest performance increase could be found when redocking 20 protein-ligand complexes of alpha-thrombin, plasmepsin, neuraminidase, and d-xylose isomerase. A decrease was found for gamma-chymotrypsin. The results show that--applied to the right target-AutoxX can improve the docking performance compared to AutoDock and FlexX alone.     

Knowledge-based scoring functions in drug design: 2. Can the knowledge base be enriched?

Fast and accurate predicting of the binding affinities of large sets of diverse protein?ligand complexes is an important, yet extremely challenging, task in drug discovery. The development of knowledge-based scoring functions exploiting structural information of known protein?ligand complexes represents a valuable contribution to such a computational prediction. In this study, we report a scoring function named IPMF that integrates additional experimental binding affinity information into the extracted potentials, on the assumption that a scoring function with the "enriched" knowledge base may achieve increased accuracy in binding affinity prediction. In our approach, the functions and atom types of PMF04 were inherited to implicitly capture binding effects that are hard to model explicitly, and a novel iteration device was designed to gradually tailor the initial potentials. We evaluated the performance of the resultant IPMF with a diverse set of 219 protein-ligand complexes and compared it with seven scoring functions commonly used in computer-aided drug design, including GLIDE, AutoDock4, VINA, PLP, LUDI, PMF, and PMF04. While the IPMF is only moderately successful in ranking native or near native conformations, it yields the lowest mean error of 1.41 log K(i)/K(d) units from measured inhibition affinities and the highest Pearson's correlation coefficient of R(p)2 0.40 for the test set. These results corroborate our initial supposition about the role of "enriched" knowledge base. With the rapid growing volume of high-quality structural and interaction data in the public domain, this work marks a positive step toward improving the accuracy of knowledge-based scoring functions in binding affinity prediction.     

Molecular docking using shape descriptors

Molecular docking explores the binding modes of two interacting molecules. The technique is increasingly popular for studying protein-ligand interactions and for drug design. A fundamental problem problem with molecular docking is that orientation space is very large and grows combinatorially with the number of degrees of freedom of the interacting molecules. Here, we describe and evaluate algorithms that improve the efficiency and accuracy of a shape-based docking method. We use molecular organization and sampling techniques to remove the exponential time dependence on molecular size in docking calculations. The new techniques allow us to study systems that were prohibitively large for the original method. The new algorithms are tested in 10 different protein-ligand systems, including 7 systems where the ligand is itself a protein. In all cases, the new algorithms successfully reproduce the experimentally determined configurations of the ligand in the protein.     

Continuum solvation models in the linear interaction energy method

The linear interaction energy (LIE) method in combination with two different continuum solvent models has been applied to calculate protein-ligand binding free energies for a set of inhibitors against the malarial aspartic protease plasmepsin II. Ligand-water interaction energies are calculated from both Poisson-Boltzmann (PB) and Generalized Born (GB) continuum models using snapshots from explicit solvent simulations of the ligand and protein-ligand complex. These are compared to explicit solvent calculations, and we find close agreement between the explicit water and PB solvation models. The GB model overestimates the change in solvation energy, and this is caused by consistent underestimation of the effective Born radii in the protein-ligand complex. The explicit solvent LIE calculations and LIE-PB, with our standard parametrization, reproduce absolute experimental binding free energies with an average unsigned error of 0.5 and 0.7 kcal/mol, respectively. The LIE-GB method, however, requires a constant offset to approach the same level of accuracy.     

Comparison of DNA hydration patterns obtained using two distinct computational methods, molecular dynamics simulation and three-dimensional reference interaction site model theory

Because proteins and DNA interact with each other and with various small molecules in the presence of water molecules, we cannot ignore their hydration when discussing their structural and energetic properties. Although high-resolution crystal structure analyses have given us a view of tightly bound water molecules on their surface, the structural data are still insufficient to capture the detailed configurations of water molecules around the surface of these biomolecules. Thanks to the invention of various computational algorithms, computer simulations can now provide an atomic view of hydration. Here, we describe the apparent patterns of DNA hydration calculated by using two different computational methods: Molecular dynamics (MD) simulation and three-dimensional reference interaction site model (3D-RISM) theory. Both methods are promising for obtaining hydration properties, but until now there have been no thorough comparisons of the calculated three-dimensional distributions of hydrating water. This rigorous comparison showed that MD and 3D-RISM provide essentially similar hydration patterns when there is sufficient sampling time for MD and a sufficient number of conformations to describe molecular flexibility for 3D-RISM. This suggests that these two computational methods can be used to complement one another when evaluating the reliability of the calculated hydration patterns.