Efficient protein-ligand docking using sustainable evolutionary algorithms

AutoDock is a widely used automated protein docking program in structure-based drug-design. Different search algorithms such as simulated annealing, traditional genetic algorithm (GA) and Lamarckian genetic algorithm (LGA) are implemented in AutoDock. However, the docking performance of these algorithms is still limited by the local optima issue of simulated annealing or the premature convergence issue typical in traditional evolutionary algorithms (EA). Due to the stochastic nature of these search algorithms, users usually need to run multiple times to get reasonable docking results, which is time-consuming. We have developed a new docking program AutoDockX by applying a sustainable GA, Age-Layered Population Structure (ALPS) to the protein docking problem. We tested the docking performance over three different proteins (pr, cox and hsp90) with more than 20 candidate ligands for each protein. Our experiments showed that the sustainable GA based AutodockX achieved significantly better docking performance in terms of running time and robustness than all the existing search algorithms implemented in the latest version of AutoDock. AutodockX thus has unique advantages in large-scale virtual screening.

[1]  Arthur J. Olson,et al.  AutoDock Vina: Improving the speed and accuracy of docking with a new scoring function, efficient optimization, and multithreading , 2009, J. Comput. Chem..

[2]  D S Goodsell,et al.  Automated docking of flexible ligands: Applications of autodock , 1996, Journal of molecular recognition : JMR.

[3]  Jaques Reifman,et al.  DOVIS: an implementation for high-throughput virtual screening using AutoDock , 2008, BMC Bioinformatics.

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

[5]  Gregory Hornby,et al.  ALPS: the age-layered population structure for reducing the problem of premature convergence , 2006, GECCO.

[6]  Gregory Hornby,et al.  Steady-state ALPS for real-valued problems , 2009, GECCO.

[7]  Jianjun Hu,et al.  The Hierarchical Fair Competition (HFC) Framework for Sustainable Evolutionary Algorithms , 2005, Evolutionary Computation.

[8]  Christopher R. Corbeil,et al.  Towards the development of universal, fast and highly accurate docking/scoring methods: a long way to go , 2008, British journal of pharmacology.

[9]  G. Hornby.  A Steady-State Version of the Age-Layered Population Structure EA , 2010 .

[10]  Jianjun Hu,et al.  Adaptive Hierarchical Fair Competition (AHFC) Model For Parallel Evolutionary Algorithms , 2002, GECCO.

[11]  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..

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

[13]  Lydia E. Kavraki,et al.  Molecular docking: a problem with thousands of degrees of freedom , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[14]  Jonathan W. Essex,et al.  A review of protein-small molecule docking methods , 2002, J. Comput. Aided Mol. Des..

[15]  Erik D. Goodman,et al.  The hierarchical fair competition (HFC) model for parallel evolutionary algorithms , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[16]  Jaques Reifman,et al.  DOVIS 2.0: an efficient and easy to use parallel virtual screening tool based on AutoDock 4.0 , 2008, Chemistry Central journal.

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