Protein-ligand Docking Problems Research Articles

Fully Flexible Molecular Alignment Enables Accurate Ligand Structure Modeling.

Accurate protein-ligand binding poses are the prerequisites of structure-based binding affinity prediction and provide the structural basis for in-depth lead optimization in small molecule drug design. However, it is challenging to provide reasonable predictions of binding poses for different molecules due to the complexity and diversity of the chemical space of small molecules. Similarity-based molecular alignment techniques can effectively narrow the search range, as structurally similar molecules are likely to have similar binding modes, with higher similarity usually correlated to higher success rates. However, molecular similarity is not consistently high because molecules often require changes to achieve specific purposes, leading to reduced alignment precision. To address this issue, we propose a new alignment method─Z-align. This method uses topological structural information as a criterion for evaluating similarity, reducing the reliance on molecular fingerprint similarity. Our method has achieved success rates significantly higher than those of other methods at moderate levels of similarity. Additionally, our approach can comprehensively and flexibly optimize bond lengths and angles of molecules, maintaining a high accuracy even when dealing with larger molecules. Consequently, our proposed solution helps in achieving more accurate binding poses in protein-ligand docking problems, facilitating the development of small molecule drugs. Z-align is freely available as a web server at https://cloud.zelixir.com/zalign/home.

Improving the artificial bee colony algorithm with a proprietary estimation of distribution mechanism for protein–ligand docking

The protein–ligand docking problem plays an essential role in structure-based drug design. The challenge for a protein–ligand docking method is how to execute an efficient conformational search to explore a well-designed scoring function. In this study, we improved the artificial bee colony (ABC) algorithm and proposed an approach called ABC-EDM to solve the protein–ligand docking problem. ABC-EDM employs the scoring function of the classical AutoDock Vina to evaluate a solution during docking simulation. ABC-EDM adopts the search framework of the canonical ABC algorithm to execute conformational search. By further investigating the characteristics of the protein–ligand docking problem, a proprietary search mechanism inspired by estimation of distribution algorithm, i.e., estimation of distribution mechanism (EDM), is designed to enhance the performance of ABC-EDM. To verify the effectiveness of the proposed ABC-EDM, we compare it with three variants of the ABC algorithm, three evolutionary computation algorithms, and AutoDock Vina. The experimental results show that ABC-EDM can effectively solve the protein–ligand docking problem, and it can achieve a success rate 5% higher than AutoDock Vina on the GOLD dataset. This study reveals that taking advantage of problem-specific information about the protein–ligand docking problem to enhance a docking method contributes to solving this problem.

Entropy-based lamarckian quantum-behaved particle swarm optimization for flexible ligand docking.

AutoDock is a widely used software for flexible ligand docking problems since it is open source and easy to be implemented. In this paper, a novel hybrid algorithm is proposed and applied in the docking environment of AutoDock version 4.2.6 in order to enhance the accuracy and the efficiency for dockings with flexible ligands. This search algorithm, called entropy-based Lamarckian quantum-behaved particle swarm optimization (ELQPSO), is a combination of the QPSO with an entropy-based update strategy and the Solis and Wet local search (SWLS) method. By using the PDBbind core set v.2016, the ELQPSO is compared with the Lamarckian genetic algorithm (LGA), Lamarckian particle swarm optimization (LPSO) and Lamarckian QPSO (LQPSO). The experimental results reveal that the corresponding docking program of ELQPSO, named as EQDOCK in this paper, has a competitive performance in dealing with the protein-ligand docking problems. Moreover, for the test cases with different number of torsions, the EQDOCK outperforms the other three docking programs in finding docking conformations with small root mean squared deviation (RMSD) values in most cases. In particular, it has an advantage of solving highly flexible ligand docking problems over the others.

A reinforcement learning approach for protein–ligand binding pose prediction

Protein ligand docking is an indispensable tool for computational prediction of protein functions and screening drug candidates. Despite significant progress over the past two decades, it is still a challenging problem, characterized by the still limited understanding of the energetics between proteins and ligands, and the vast conformational space that has to be searched to find a satisfactory solution. In this project, we developed a novel reinforcement learning (RL) approach, the asynchronous advantage actor-critic model (A3C), to address the protein ligand docking problem. The overall framework consists of two models. During the search process, the agent takes an action selected by the actor model based on the current location. The critic model then evaluates this action and predict the distance between the current location and true binding site. Experimental results showed that in both single- and multi-atom cases, our model improves binding site prediction substantially compared to a naïve model. For the single-atom ligand, copper ion (Cu2+), the model predicted binding sites have a median root-mean-square-deviation (RMSD) of 2.39 Å to the true binding sites when starting from random starting locations. For the multi-atom ligand, sulfate ion (SO42−), the predicted binding sites have a median RMSD of 3.82 Å to the true binding sites. The ligand-specific models built in this study can be used in solvent mapping studies and the RL framework can be readily scaled up to larger and more diverse sets of ligands.

Protein–ligand docking using differential evolution with an adaptive mechanism

The protein–ligand docking problem plays a crucial role in the drug discovery process and remains challenging in bioinformatics. A successful protein–ligand docking approach depends on two key factors: an efficient search strategy and an effective scoring function. In this study, we attempt to use an adaptive differential evolution (DE) algorithm as the search strategy. The search ability of the proposed DE algorithm is improved by incorporating a parameter adaptation scheme and a modified mutation strategy. In addition, the scoring function of the classical AutoDock Vina suite is employed as the fitness function of the proposed approach. Finally, the performance of the adaptive DE method in solving the protein–ligand docking problem is evaluated on 40 test docking instances. The experimental results and statistical analysis demonstrate the effectiveness of the proposed adaptive DE algorithm compared with five other classical evolutionary algorithms. The results of this study reveal that employing powerful evolutionary algorithms, such as adaptive DE, contributes to solving the protein–ligand docking problem.

A Novel Fireworks Algorithm for the Protein-Ligand Docking on the AutoDock

The AutoDock is a widely used protein-ligand docking simulation platform which is a simulator to bring the field of computer-aided drug design (CADD) conveniences. The protein-ligand docking problem is of great significance to design more effective and ideal drugs. In order to solve the protein-ligand docking problem more effectively, we propose an improved fireworks algorithm called FWADOCK. FWADOCK utilizes the position updating information of fireworks with the best fitness value to determine the shape of the fireworks and the distribution of sparks. During the process of searching for the optimal solution, it is also considered that the diversity of understanding and how to avoid premature convergence of the algorithm. The proposed algorithm is tested on some benchmark test cases of protein-ligand docking problems and compared with some other related algorithms from different perspectives on the AutoDock platform. The results show that FWADOCK has a competitive performance in solving the protein-ligand docking problem.

Enhanced Deep-Learning Prediction of Molecular Properties via Augmentation of Bond Topology.

Deep learning has made great strides in tackling chemical problems, but still lacks full-fledged representations for three-dimensional (3D) molecular structures for its inner working. For example, the molecular graph, commonly used in chemistry and recently adapted to the graph convolutional network (GCN), is inherently a 2D representation of 3D molecules. Herein we propose an advanced version of the GCN, called 3DGCN, which receives 3D molecular information from a molecular graph augmented by information on bond direction. While outperforming state-of-the-art deep-learning models in the prediction of chemical and biological properties, 3DGCN has the ability to both generalize and distinguish molecular rotations in 3D, beyond 2D, which has great impact on drug discovery and development, not to mention the design of chemical reactions.

A Hybrid Cuckoo Search and Differential Evolution Approach to Protein⁻Ligand Docking.

Protein–ligand docking is a molecular modeling technique that is used to predict the conformation of a small molecular ligand at the binding pocket of a protein receptor. There are many protein–ligand docking tools, among which AutoDock Vina is the most popular open-source docking software. In recent years, there have been numerous attempts to optimize the search process in AutoDock Vina by means of heuristic optimization methods, such as genetic and particle swarm optimization algorithms. This study, for the first time, explores the use of cuckoo search (CS) to solve the protein–ligand docking problem. The result of this study is CuckooVina, an enhanced conformational search algorithm that hybridizes cuckoo search with differential evolution (DE). Extensive tests using two benchmark datasets, PDBbind 2012 and Astex Diverse set, show that CuckooVina improves the docking performances in terms of RMSD, binding affinity, and success rate compared to Vina though it requires about 9–15% more time to complete a run than Vina. CuckooVina predicts more accurate docking poses with higher binding affinities than PSOVina with similar success rates. CuckooVina’s slower convergence but higher accuracy suggest that it is better able to escape from local energy minima and improves the problem of premature convergence. As a summary, our results assure that the hybrid CS–DE process to continuously generate diverse solutions is a good strategy to maintain the proper balance between global and local exploitation required for the ligand conformational search.

A biased random key genetic algorithm for the protein–ligand docking problem

Molecular docking is a valuable tool for drug discovery. Receptor and flexible Ligand docking is a very computationally expensive process due to a large number of degrees of freedom of the ligand and the roughness of the molecular binding search space. A molecular docking simulation starts with receptor and ligand unbound structures, and the algorithm tests hundreds of thousands of ligand conformations and orientations to find the best receptor–ligand binding affinity by assigning and optimizing an energy function. Although the advances in the conception of methods and computational strategies for searching the best protein–ligand binding affinity, the development of new strategies, the adaptation, and investigation of new approaches and the combination of existing and state-of-the-art computational methods and techniques to the molecular docking problem are needed. We developed a Biased Random Key Genetic Algorithm as a sampling strategy to search the protein–ligand conformational space. We use a different method to discretize the search space. The proposed method (namely, BRKGA-DOCK) has been tested on a selection of protein–ligand complexes and compared to existing tools AUTODOCK VINA, DOCKTHOR, and a multiobjective approach (jMETAL). Compared to other traditional docking software, the proposed method shows best average Root-Mean-Square Deviation. Structural results were also statistically analyzed. The proposed method proved to be efficient and a good alternative for the molecular docking problem.

Molecular Docking: From Lock and Key to Combination Lock.

Accurate modeling of protein ligand binding is an important step in structure-based drug design, is a useful starting point for finding new lead compounds or drug candidates. The 'Lock and Key' concept of protein-ligand binding has dominated descriptions of these interactions, and has been effectively translated to computational molecular docking approaches. In turn, molecular docking can reveal key elements in protein-ligand interactions-thereby enabling design of potent small molecule inhibitors directed against specific targets. However, accurate predictions of binding pose and energetic remain challenging problems. The last decade has witnessed more sophisticated molecular docking approaches to modeling protein-ligand binding and energetics. However, the complexities that confront accurate modeling of binding phenomena remain formidable. Subtle recognition and discrimination patterns governed by three-dimensional features and microenvironments of the active site play vital roles in consolidating the key intermolecular interactions that mediates ligand binding. Herein, we briefly review contemporary approaches and suggest that future approaches treat protein-ligand docking problems in the context of a 'combination lock' system.

HIGA: A Running History Information Guided Genetic Algorithm for Protein-Ligand Docking.

Protein-ligand docking is an essential part of computer-aided drug design, and it identifies the binding patterns of proteins and ligands by computer simulation. Though Lamarckian genetic algorithm (LGA) has demonstrated excellent performance in terms of protein-ligand docking problems, it can not memorize the history information that it has accessed, rendering it effort-consuming to discover some promising solutions. This article illustrates a novel optimization algorithm (HIGA), which is based on LGA for solving the protein-ligand docking problems with an aim to overcome the drawback mentioned above. A running history information guided model, which includes CE crossover, ED mutation, and BSP tree, is applied in the method. The novel algorithm is more efficient to find the lowest energy of protein-ligand docking. We evaluate the performance of HIGA in comparison with GA, LGA, EDGA, CEPGA, SODOCK, and ABC, the results of which indicate that HIGA outperforms other search algorithms.

Genetic algorithm with a crossover elitist preservation mechanism for protein\u2013ligand docking

Protein–ligand docking plays an important role in computer-aided pharmaceutical development. Protein–ligand docking can be defined as a search algorithm with a scoring function, whose aim is to determine the conformation of the ligand and the receptor with the lowest energy. Hence, to improve an efficient algorithm has become a very significant challenge. In this paper, a novel search algorithm based on crossover elitist preservation mechanism (CEP) for solving protein–ligand docking problems is proposed. The proposed algorithm, namely genetic algorithm with crossover elitist preservation (CEPGA), employ the CEP to keep the elite individuals of the last generation and make the crossover more efficient and robust. The performance of CEPGA is tested on sixteen molecular docking complexes from RCSB protein data bank. In comparison with GA, LGA and SODOCK in the aspects of lowest energy and highest accuracy, the results of which indicate that the CEPGA is a reliable and successful method for protein–ligand docking problems.

Exploiting multilevel parallelism on a many-core system for the application of hyperheuristics to a molecular docking problem

The solution of Protein–Ligand Docking Problems can be approached through metaheuristics, and satisfactory metaheuristics can be obtained with hyperheuristics searching in the space of metaheuristics implemented inside a parameterized schema. These hyperheuristics apply several metaheuristics, resulting in high computational costs. To reduce execution times, a shared-memory schema of hyperheuristics is used with four levels of parallelism, two for the hyperheuristic and two for the metaheuristics. The parallel schema is executed in a many-core system in “native mode,” and the four-level parallelism allows us to take full advantage of the massive parallelism offered by this architecture and obtain satisfactory fitness and an important reduction in the execution time.

A New Approach for Flexible Molecular Docking Based on Swarm Intelligence

Molecular docking methods play an important role in the field of computer-aided drug design. In the work, on the basis of the molecular docking program AutoDock, we present QLDock as a tool for flexible molecular docking. For the energy evaluation, the algorithm uses the binding free energy function that is provided by the AutoDock 4.2 tool. The new search algorithm combines the features of a quantum-behaved particle swarm optimization (QPSO) algorithm and local search method of Solis and Wets for solving the highly flexible protein-ligand docking problem. We compute the interaction of 23 protein-ligand complexes and compare the results with those of the QDock and AutoDock programs. The experimental results show that our approach leads to substantially lower docking energy and higher docking precision in comparison to Lamarckian genetic algorithm and QPSO algorithm alone. QPSO-ls algorithm was able to identify the correct binding mode of 74% of the complexes. In comparison, the accuracy of QPSO and LGA is 52% and 61%, respectively. This difference in performance rises with increasing complexity of the ligand. Thus, the novel algorithm QPSO-ls may be used to dock ligand with many rotatable bonds with high accuracy.

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.

Global optimization in protein docking using clustering, underestimation and semidefinite programming

The underestimation of data points by a convex quadratic function is a useful tool for approximating the location of the global minima of potential energy functions that arise in protein-ligand docking problems. Determining the parameters that define the underestimator can be formulated as a convex quadratically constrained quadratic program and solved efficiently using algorithms for semidefinite programming (SDP). In this paper, we formulate and solve the underestimation problem using SDP and present numerical results for active site prediction in protein docking.

An ant colony optimization approach to flexible protein–ligand docking

The prediction of the complex structure of a small ligand with a protein, the so-called protein–ligand docking problem, is a central part of the rational drug design process. For this purpose, we introduce the docking algorithm PLANTS (Protein–Ligand ANT System), which is based on ant colony optimization, one of the most successful swarm intelligence techniques. We study the effectiveness of PLANTS for several parameter settings and present a direct comparison of PLANTS’s performance to a state-of-the-art program called GOLD, which is based on a genetic algorithm and frequently used in the pharmaceutical industry for this task. Last but not least, we also show that PLANTS can make effective use of protein flexibility giving example results on cross-docking and virtual screening experiments for protein kinase A.

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.