Flexible ligand docking using differential evolution

Molecular docking of biomolecules is becoming an increasingly important part in the process of developing new drugs, as well as searching compound databases for promising drug candidates. The docking of ligands to proteins can be formulated as an optimization problem where the task is to find the most favorable energetic conformation among the large space of possible protein-ligand complexes. Stochastic search methods, such as evolutionary algorithms (EAs), can be used to sample large search spaces effectively and is one of the preferred methods for flexible ligand docking. The differential evolution algorithm (DE) is applied to the docking problem using the AutoDock program. The introduced DockDE algorithm is compared with the Lamarckian GA (LGA) provided with AutoDock, and the DockEA previously found to outperform the LGA. The comparison is performed on a suite of six commonly used docking problems. In conclusion, the introduced DockDE outperformed the other algorithms on all problems. Further, the DockDE showed remarkable performance in terms of convergence speed and robustness regarding the found solution.

[1]  Roger J.-B. Wets,et al.  Minimization by Random Search Techniques , 1981, Math. Oper. Res..

[2]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[3]  David E. Clark,et al.  Evolutionary algorithms in computer-aided molecular design , 1996, J. Comput. Aided Mol. Des..

[4]  T. N. Bhat,et al.  The Protein Data Bank , 2000, Nucleic Acids Res..

[5]  N. Madavan.  Multiobjective optimization using a Pareto differential evolution approach , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[6]  C. Sander,et al.  An effective solvation term based on atomic occupancies for use in protein simulations , 1993 .

[7]  René Thomsen,et al.  Flexible ligand docking using evolutionary algorithms: investigating the effects of variation operators and local search hybrids. , 2003, Bio Systems.

[8]  David S. Goodsell,et al.  Distributed automated docking of flexible ligands to proteins: Parallel applications of AutoDock 2.4 , 1996, J. Comput. Aided Mol. Des..

[9]  David S. Goodsell,et al.  Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function , 1998, J. Comput. Chem..

[10]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[11]  P Willett,et al.  Development and validation of a genetic algorithm for flexible docking. , 1997, Journal of molecular biology.

[12]  William E. Hart,et al.  A Comparison of Global and Local Search Methods in Drug Docking , 1997, ICGA.

[13]  A. Leach,et al.  Ligand docking to proteins with discrete side-chain flexibility. , 1994, Journal of molecular biology.

[14]  Rainer Storn,et al.  Differential Evolution-A simple evolution strategy for fast optimization , 1997 .

[15]  William E. Hart,et al.  Improved Evolutionary Hybrids for Flexible Ligand Docking in Autodock , 2000 .

[16]  R. Storn,et al.  Differential evolution a simple and efficient adaptive scheme for global optimization over continu , 1997 .

[17]  David E. Clark,et al.  A comparison of heuristic search algorithms for molecular docking , 1997, J. Comput. Aided Mol. Des..

[18]  David E. Clark,et al.  Evolutionary Algorithms in Molecular Design: Clark/Evolutionary , 2000 .

[19]  D. Goodsell,et al.  Automated docking of substrates to proteins by simulated annealing , 1990, Proteins.

[20]  Cheng-Yan Kao,et al.  Integrating adaptive mutations and family competition with differential evolution for flexible ligand docking , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).