LigDockCSA: protein-ligand docking using conformational space annealing

Protein–ligand docking techniques are one of the essential tools for structure‐based drug design. Two major components of a successful docking program are an efficient search method and an accurate scoring function. In this work, a new docking method called LigDockCSA is developed by using a powerful global optimization technique, conformational space annealing (CSA), and a scoring function that combines the AutoDock energy and the piecewise linear potential (PLP) torsion energy. It is shown that the CSA search method can find lower energy binding poses than the Lamarckian genetic algorithm of AutoDock. However, lower‐energy solutions CSA produced with the AutoDock energy were often less native‐like. The loophole in the AutoDock energy was fixed by adding a torsional energy term, and the CSA search on the refined energy function is shown to improve the docking performance. The performance of LigDockCSA was tested on the Astex diverse set which consists of 85 protein–ligand complexes. LigDockCSA finds the best scoring poses within 2 Å root‐mean‐square deviation (RMSD) from the native structures for 84.7% of the test cases, compared to 81.7% for AutoDock and 80.5% for GOLD. The results improve further to 89.4% by incorporating the conformational entropy. © 2011 Wiley Periodicals, Inc. J Comput Chem, 2011     

Flexible protein‐protein docking based on Best‐First search algorithm

We developed a new high resolution protein‐protein docking method based on Best‐First search algorithm that loosely imitates protein‐protein associations. The method operates in two stages: first, we perform a rigid search on the unbound proteins. Second, we search alternately on rigid and flexible degrees of freedom starting from multiple configurations from the rigid search. Both stages use heuristics added to the energy function, which causes the proteins to rapidly approach each other and remain adjacent, while optimizing on the energy. The method deals with backbone flexibility explicitly by searching over ensembles of conformations generated before docking. We ran the rigid docking stage on 66 complexes and grouped the results into four classes according to evaluation criteria used in Critical Assessment of Predicted Interactions (CAPRI; “high,” “medium,” “acceptable,” and “incorrect”). Our method found medium binding conformations for 26% of the complexes and acceptable for additional 44% among the top 10 configurations. Considering all the configurations, we found medium binding conformations for 55% of the complexes and acceptable for additional 39% of the complexes. Introducing side‐chains flexibility in the second stage improves the best found binding conformation but harms the ranking. However, introducing side‐chains and backbone flexibility improve both the best found binding conformation and the best found conformation in the top 10. Our approach is a basis for incorporating multiple flexible motions into protein‐protein docking and is of interest even with the current use of a simple energy function. © 2010 Wiley Periodicals, Inc. J Comput Chem, 2010     

Distributed automated docking of flexible ligands to proteins: Parallel applications of AutoDock 2.4

Summary AutoDock 2.4 predicts the bound conformations of a small, flexible ligand to a nonflexible macromolecular target of known structure. The technique combines simulated annealing for conformation searching with a rapid grid-based method of energy evaluation based on the AMBER force field. AutoDock has been optimized in performance without sacrificing accuracy; it incorporates many enhancements and additions, including an intuitive interface. We have developed a set of tools for launching and analyzing many independent docking jobs in parallel on a heterogeneous network of UNIX-based workstations. This paper describes the current release, and the results of a suite of diverse test systems. We also present the results of a systematic investigation into the effects of varying simulated-annealing parameters on molecular docking. We show that even for ligands with a large number of degrees of freedom, root-mean-square deviations of less than 1 Å from the crystallographic conformation are obtained for the lowest-energy dockings, although fewer dockings find the crystallographic conformation when there are more degrees of freedom.The AutoDock 2.4 suite is written in ANSI C, and is supplied with Makefiles for the following platforms: Convex, DEC Alpha OSF/1, Hewlett-Packard Precision Architecture, Silicon Graphics, and Sun. The AutoDock suite of programs is freely available to the noncommercial scientific community and to educational establishments. Further information, including additional figures and MPEG animations showing all docked conformations for each test system, can be found at the following URL: http://www.scripps.edu/pub/olson-web/doc/autodock.     

Evaluations of molecular docking programs for virtual screening

Structure-based virtual screening is carried out using molecular docking programs. A number of such docking programs are currently available, and the selection of docking program is difficult without knowing the characteristics or performance of each program. In this study, the screening performances of three molecular docking programs, DOCK, AutoDock, and GOLD, were evaluated with 116 target proteins. The screening performances were validated using two novel standards, along with a traditional enrichment rate measurement. For the evaluations, each docking run was repeated 1000 times with three initial conformations of a ligand. While each docking program has some merit over the other docking programs in some aspects, DOCK showed an unexpectedly better screening performance in the enrichment rates. Finally, we made several recommendations based on the evaluation results to enhance the screening performances of the docking programs.     

Assessing search strategies for flexible docking

We assess the efficiency of molecular dynamics (MD), Monte Carlo (MC), and genetic algorithms (GA) for docking five representative ligand–receptor complexes. All three algorithms employ a modified CHARMM-based energy function. The algorithms are also compared with an established docking algorithm, AutoDock. The receptors are kept rigid while flexibility of ligands is permitted. To test the efficiency of the algorithms, two search spaces are used: an 11-Å-radius sphere and a 2.5-Å-radius sphere, both centered on the active site. We find MD is most efficient in the case of the large search space, and GA outperforms the other methods in the small search space. We also find that MD provides structures that are, on average, lower in energy and closer to the crystallographic conformation. The GA obtains good solutions over the course of the fewest energy evaluations. However, due to the nature of the nonbonded interaction calculations, the GA requires the longest time for a single energy evaluation, which results in a decreased efficiency. The GA and MC search algorithms are implemented in the CHARMM macromolecular package. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 1623–1631, 1998     

Automated docking of ligands to an artificial active site: augmenting crystallographic analysis with computer modeling

The W191G cavity of cytochrome c peroxidase is useful as a model system for introducing small molecule oxidation in an artificially created cavity. A set of small, cyclic, organic cations was previously shown to bind in the buried, solvent-filled pocket created by the W191G mutation. We docked these ligands and a set of non-binders in the W191G cavity using AutoDock 3.0. For the ligands, we compared docking predictions with experimentally determined binding energies and X-ray crystal structure complexes. For the ligands, predicted binding energies differed from measured values by +/- 0.8 kcal/mol. For most ligands, the docking simulation clearly predicted a single binding mode that matched the crystallographic binding mode within 1.0 A RMSD. For 2 ligands, where the docking procedure yielded an ambiguous result, solutions matching the crystallographic result could be obtained by including an additional crystallographically observed water molecule in the protein model. For the remaining 2 ligands, docking indicated multiple binding modes, consistent with the original electron density, suggesting disordered binding of these ligands. Visual inspection of the atomic affinity grid maps used in docking calculations revealed two patches of high affinity for hydrogen bond donating groups. Multiple solutions are predicted as these two sites compete for polar hydrogens in the ligand during the docking simulation. Ligands could be distinguished, to some extent, from non-binders using a combination of two trends: predicted binding energy and level of clustering. In summary, AutoDock 3.0 appears to be useful in predicting key structural and energetic features of ligand binding in the W191G cavity.     

A Gibbs free energy correlation for automated docking of carbohydrates

Thermodynamic information can be inferred from static atomic configurations. To model the thermodynamics of carbohydrate binding to proteins accurately, a large binding data set has been assembled from the literature. The data set contains information from 262 unique protein-carbohydrate crystal structures for which experimental binding information is known. Hydrogen atoms were added to the structures and training conformations were generated with the automated docking program AutoDock 3.06, resulting in a training set of 225,920 all-atom conformations. In all, 288 formulations of the AutoDock 3.0 free energy model were trained against the data set, testing each of four alternate methods of computing the van der Waals, solvation, and hydrogen-bonding energetic components. The van der Waals parameters from AutoDock 1 produced the lowest errors, and an entropic model derived from statistical mechanics produced the only models with five physically and statistically significant coefficients. Eight models predict the Gibbs free energy of binding with an error of less than 40% of the error of any similar models previously published.     

Accelerating AutoDock Vina with GPUs

AutoDock Vina is one of the most popular molecular docking tools. In the latest benchmark CASF-2016 for comparative assessment of scoring functions, AutoDock Vina won the best docking power among all the docking tools. Modern drug discovery is facing a common scenario of large virtual screening of drug hits from huge compound databases. Due to the seriality characteristic of the AutoDock Vina algorithm, there is no successful report on its parallel acceleration with GPUs. Current acceleration of AutoDock Vina typically relies on the stack of computing power as well as the allocation of resource and tasks, such as the VirtualFlow platform. The vast resource expenditure and the high access threshold of users will greatly limit the popularity of AutoDock Vina and the flexibility of its usage in modern drug discovery. In this work, we proposed a new method, Vina-GPU, for accelerating AutoDock Vina with GPUs, which is greatly needed for reducing the investment for large virtual screens and also for wider application in large-scale virtual screening on personal computers, station servers or cloud computing, etc. Our proposed method is based on a modified Monte Carlo using simulating annealing AI algorithm. It greatly raises the number of initial random conformations and reduces the search depth of each thread. Moreover, a classic optimizer named BFGS is adopted to optimize the ligand conformations during the docking progress, before a heterogeneous OpenCL implementation was developed to realize its parallel acceleration leveraging thousands of GPU cores. Large benchmark tests show that Vina-GPU reaches an average of 21-fold and a maximum of 50-fold docking acceleration against the original AutoDock Vina while ensuring their comparable docking accuracy, indicating its potential for pushing the popularization of AutoDock Vina in large virtual screens.     

SODOCK: swarm optimization for highly flexible protein-ligand docking

Protein-ligand docking can be formulated as a parameter optimization problem associated with an accurate scoring function, which aims to identify the translation, orientation, and conformation of a docked ligand with the lowest energy. The parameter optimization problem for highly flexible ligands with many rotatable bonds is more difficult than that for less flexible ligands using genetic algorithm (GA)-based approaches, due to the large numbers of parameters and high correlations among these parameters. This investigation presents a novel optimization algorithm SODOCK based on particle swarm optimization (PSO) for solving flexible protein-ligand docking problems. To improve efficiency and robustness of PSO, an efficient local search strategy is incorporated into SODOCK. The implementation of SODOCK adopts the environment and energy function of AutoDock 3.05. Computer simulation results reveal that SODOCK is superior to the Lamarckian genetic algorithm (LGA) of AutoDock, in terms of convergence performance, robustness, and obtained energy, especially for highly flexible ligands. The results also reveal that PSO is more suitable than the conventional GA in dealing with flexible docking problems with high correlations among parameters. This investigation also compared SODOCK with four state-of-the-art docking methods, namely GOLD 1.2, DOCK 4.0, FlexX 1.8, and LGA of AutoDock 3.05. SODOCK obtained the smallest RMSD in 19 of 37 cases. The average 2.29 A of the 37 RMSD values of SODOCK was better than those of other docking programs, which were all above 3.0 A.     

A method for fast energy estimation and visualization of protein-ligand interaction

Summary A new computational and graphical method for facilitating ligand-protein docking studies is developed on a three-dimensional computer graphics display. Various physical and chemical properties inside the ligand binding pocket of a receptor protein, whose structure is elucidated by X-ray crystal analysis, are calculated on three-dimensional grid points and are stored in advance. By utilizing those tabulated data, it is possible to estimate the non-bonded and electrostatic interaction energy and the number of possible hydrogen bonds between protein and ligand molecules in real time during an interactive docking operation. The method also provides a comprehensive visualization of the local environment inside the binding pocket.With this method, it becomes easier to find a roughly stable geometry of ligand molecules, and one can therefore make a rapid survey of the binding capability of many drug candidates. The method will be useful for drug design as well as for the examination of protein-ligand interactions.     

Conformational and docking studies of acyl homoserine lactones as a robust method to investigate bioactive conformations

A method aiming at investigating possible bioactive conformations of acyl homoserine lactone (AHL) quorum sensing (QS) modulators is established. The method relies on the exhaustive conformational analysis of AHLs by varying torsion angles around the amide group then on the selection of the closest conformation to those known from co-crystallized XRD data of AHL-receptor complexes. These latter are then docked as rigid ligand within the receptor binding site, leading to interactions with binding site residues which are highly consistent as compared with the data arising from XRD studies. The method is first validated using AHLs for which XRD data of their complexes with their cognate receptor are available, then extended to examples for which the binding mode is still unknown.Three compounds were used to validate the method: hexanoyl homoserine lactone (HHL) as an example of autoinducer, 3-oxo-butanoyl homoserine lactone (OBHL), as a representative model of 3-oxo-AHLs, and 4-(4-chlorophenoxy)butanoyl homoserine lactone (CPOBHL) as an example of a QS inhibitor. The conformational analysis of these three compounds to their cognate protein (TraR, SdiA, LasR and CviR) provides the data which enable the next rigid docking step. Further rigid docking of the closest conformations compared to the known bioactive ones within the binding sites allows to recover the expected binding mode with high precision (atomic RMSD < 2 Å). This “conformational analysis/torsion angle filter/rigid ligand docking” method was then used for investigating three non-natural AHL-type QS inhibitors without known co-crystallized XRD structures, namely was 2-hexenoyl homoserine lactone (HenHL), 3-oxo-4-phenylbutanoyl homoserine lactone (OPBHL) and 3-(4-bromophenyl)propanoyl homoserine lactone (BPPHL). Results provide insights into their possible binding mode by identifying specific interactions with some key residues within the receptor binding site, allowing discussion of their biological activity.     

GalaxyDock2: Protein–ligand docking using beta‐complex and global optimization

In this article, an enhanced version of GalaxyDock protein–ligand docking program is introduced. GalaxyDock performs conformational space annealing (CSA) global optimization to find the optimal binding pose of a ligand both in the rigid‐receptor mode and the flexible‐receptor mode. Binding pose prediction has been improved compared to the earlier version by the efficient generation of high‐quality initial conformations for CSA using a predocking method based on a beta‐complex derived from the Voronoi diagram of receptor atoms. Binding affinity prediction has also been enhanced by using the optimal combination of energy components, while taking into consideration the energy of the unbound ligand state. The new version has been tested in terms of binding mode prediction, binding affinity prediction, and virtual screening on several benchmark sets, showing improved performance over the previous version and AutoDock, on which the GalaxyDock energy function is based. GalaxyDock2 also performs better than or comparable to other state‐of‐the‐art docking programs. GalaxyDock2 is freely available at http://galaxy.seoklab.org/softwares/galaxydock.html . © 2013 Wiley Periodicals, Inc.     

Supercomputer docking with a large number of degrees of freedom

ABSTRACT

Docking represents one of the most popular computational approaches in drug design. It has reached popularity owing to capability of identifying correct conformations of a ligand within an active site of the target-protein and of estimating the binding affinity of a ligand that is immensely helpful in prediction of compound activity. Despite many success stories, there are challenges, in particular, handling with a large number of degrees of freedom in solving the docking problem. Here, we show that SOL-P, the docking program based on the new Tensor Train algorithm, is capable to dock successfully oligopeptides having up to 25 torsions. To make the study comparative we have performed docking of the same oligopeptides with the SOL program which uses the same force field as that utilized by SOL-P and has common features of many docking programs: the genetic algorithm of the global optimization and the grid approximation. SOL has managed to dock only one oligopeptide. Moreover, we present the results of docking with SOL-P ligands into proteins with moveable atoms. Relying on visual observations we have determined the common protein atom groups displaced after docking which seem to be crucial for successful prediction of experimental conformations of ligands.     

FIPSDock: A new molecular docking technique driven by fully informed swarm optimization algorithm

The accurate prediction of protein–ligand binding is of great importance for rational drug design. We present herein a novel docking algorithm called as FIPSDock, which implements a variant of the Fully Informed Particle Swarm (FIPS) optimization method and adopts the newly developed energy function of AutoDock 4.20 suite for solving flexible protein–ligand docking problems. The search ability and docking accuracy of FIPSDock were first evaluated by multiple cognate docking experiments. In a benchmarking test for 77 protein/ligand complex structures derived from GOLD benchmark set, FIPSDock has obtained a successful predicting rate of 93.5% and outperformed a few docking programs including particle swarm optimization (PSO)@AutoDock, SODOCK, AutoDock, DOCK, Glide, GOLD, FlexX, Surflex, and MolDock. More importantly, FIPSDock was evaluated against PSO@AutoDock, SODOCK, and AutoDock 4.20 suite by cross‐docking experiments of 74 protein–ligand complexes among eight protein targets (CDK2, ESR1, F2, MAPK14, MMP8, MMP13, PDE4B, and PDE5A) derived from Sutherland‐crossdock‐set. Remarkably, FIPSDock is superior to PSO@AutoDock, SODOCK, and AutoDock in seven out of eight cross‐docking experiments. The results reveal that FIPS algorithm might be more suitable than the conventional genetic algorithm‐based algorithms in dealing with highly flexible docking problems. © 2012 Wiley Periodicals, Inc.     

Power transformations improve interpolation of grids for molecular mechanics interaction energies

A common strategy for speeding up molecular docking calculations is to precompute nonbonded interaction energies between a receptor molecule and a set of three‐dimensional grids. The grids are then interpolated to compute energies for ligand atoms in many different binding poses. Here, I evaluate a smoothing strategy of taking a power transformation of grid point energies and inverse transformation of the result from trilinear interpolation. For molecular docking poses from 85 protein‐ligand complexes, this smoothing procedure leads to significant accuracy improvements, including an approximately twofold reduction in the root mean square error at a grid spacing of 0.4 Å and retaining the ability to rank docking poses even at a grid spacing of 0.7 Å. © 2018 Wiley Periodicals, Inc.     

Assessment of programs for ligand binding affinity prediction

The prediction of the binding free energy between a ligand and a protein is an important component in the virtual screening and lead optimization of ligands for drug discovery. To determine the quality of current binding free energy estimation programs, we examined FlexX, X-Score, AutoDock, and BLEEP for their performance in binding free energy prediction in various situations including cocrystallized complex structures, cross docking of ligands to their non-cocrystallized receptors, docking of thermally unfolded receptor decoys to their ligands, and complex structures with "randomized" ligand decoys. In no case was there a satisfactory correlation between the experimental and estimated binding free energies over all the datasets tested. Meanwhile, a strong correlation between ligand molecular weight-binding affinity correlation and experimental predicted binding affinity correlation was found. Sometimes the programs also correctly ranked ligands' binding affinities even though native interactions between the ligands and their receptors were essentially lost because of receptor deformation or ligand randomization, and the programs could not decisively discriminate randomized ligand decoys from their native ligands; this suggested that the tested programs miss important components for the accurate capture of specific ligand binding interactions.     

AutoDock Vina: Improving the speed and accuracy of docking with a new scoring function,efficient optimization,and multithreading

AutoDock Vina, a new program for molecular docking and virtual screening, is presented. AutoDock Vina achieves an approximately two orders of magnitude speed‐up compared with the molecular docking software previously developed in our lab (AutoDock 4), while also significantly improving the accuracy of the binding mode predictions, judging by our tests on the training set used in AutoDock 4 development. Further speed‐up is achieved from parallelism, by using multithreading on multicore machines. AutoDock Vina automatically calculates the grid maps and clusters the results in a way transparent to the user. © 2009 Wiley Periodicals, Inc. J Comput Chem 2010     

AutoDock4 and AutoDockTools4: Automated docking with selective receptor flexibility

We describe the testing and release of AutoDock4 and the accompanying graphical user interface AutoDockTools. AutoDock4 incorporates limited flexibility in the receptor. Several tests are reported here, including a redocking experiment with 188 diverse ligand‐protein complexes and a cross‐docking experiment using flexible sidechains in 87 HIV protease complexes. We also report its utility in analysis of covalently bound ligands, using both a grid‐based docking method and a modification of the flexible sidechain technique. © 2009 Wiley Periodicals, Inc. J Comput Chem, 2009     

Flexible ligand docking without parameter adjustment across four ligand–receptor complexes

Understanding molecular recognition is one of the fundamental problems in molecular biology. Computationally, molecular recognition is formulated as a docking problem. Ideally, a molecular docking algorithm should be computationally efficient, provide reasonably thorough search of conformational space, obtain solutions with reasonable consistency, and not require parameter adjustments. With these goals in mind, we developed DIVALI (Docking wIth eVolutionary AlgorIthms), a program which efficiently and reliably searches for the possible binding modes of a ligand within a fixed receptor. We use an AMBER-type potential function and search for good ligand conformations using a genetic algorithm (GA). We apply our system to study the docking of both rigid and flexible ligands in four different complexes. Our results indicate that it is possible to find diverse binding modes, including structures like the crystal structure, all with comparable potential function values. To achieve this, certain modifications to the standard GA recipe are essential. © 1995 John Wiley & Sons, Inc.