A Biased Random Key Genetic Algorithm with Local Search Chains for Molecular Docking
Molecular Docking is an essential tool in drug discovery. The procedure for finding the best energy affinity between ligand-receptor molecules is a computationally expensive optimization process because of the roughness of the search space and the thousands of possible conformations of ligand. In this way, besides a realistic energy function to evaluate possible solutions, a robust search method must be applied to avoid local minimums. Recently, many algorithms have been proposed to solve the docking problem, mainly based on Evolutionary Strategies. However, the question remained unsolved and its needed the development of new and efficient techniques. In this paper, we developed a Biased Random Key Genetic Algorithm, as global search procedure, hybridized with three variations of Hill-climbing and a Simulated Annealing version, as local search strategies. To evaluate the receptor-ligand binding affinity we used the Rosetta scoring function. The proposed approaches have been tested on a benchmark of protein-ligand complexes and compared to existing tools AUTODOCK VINA, DOCKTHOR, and jMETAL. A statistical test was performed on the results, and shown that the application of local search methods provides better solutions for the molecular docking problem.
KeywordsStructural Bioinformatics Molecular Docking Memetic Algorithms Local Search Chains
This work was supported by grants from FAPERGS [16/2551-0000520-6], MCT/CNPq [311022/2015-4; 311611/2018-4], CAPES-STIC AMSUD [88887.135130/2017-01] - Brazil, Alexander von Humboldt-Stiftung (AvH) [BRA 1190826 HFST CAPES-P] - Germany. This study was financed in part by the Coordenacão de Aperfei çoamento de Pessoal de Nível Superior - Brazil (CAPES) - Finance Code 001.
- 1.López-Camacho, E., Godoy, M.J.G., Nebro, A.J., Aldana-Montes, J.F.: jMetalCpp: optimizing molecular docking problems with a C++ metaheuristic framework. Bioinformatics 20, 437–438 (2013)Google Scholar
- 6.Kukkonen, S., Lampinen, J.: GDE3: the third evolution step of generalized differential evolution. In: IEEE CEC, pp. 443–450 (2005)Google Scholar
- 7.Nebro, A., Durillo, J., García-Nieto, J., Coello, C., Luna, F., Alba, E.: SMPSO: a new PSO-based metaheuristic for multi-objective optimization. In: 2009 IEEE Symposium on Computational Intelligence in Multicriteria Decision-Making, pp. 66–73 (2009)Google Scholar
- 9.Leonhart, P.F., Spieler, E., Ligabue-Braun, R., Dorn, M.: A biased random key genetic algorithm for the protein–ligand docking problem. Soft Comput. 1–22 (2018)Google Scholar
- 15.Rosin, C.D., Halliday, R.S., Hart, W.E., Belew, R.K.: A comparison of global and local search methods in drug docking. In: Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 221–228. Morgan Kaufmann (1997)Google Scholar
- 16.Ruiz-Tagle, B., Villalobos-Cid, M., Dorn, M., Inostroza-Ponta, M.: Evaluating the use of local search strategies for a memetic algorithm for the protein-ligand docking problem. In: 2017 36th International Conference of the Chilean Computer Science Society (SCCC), pp. 1–12, October 2017Google Scholar
- 26.Goulart, N., de Souza, S.R., Dias, L.G.S., Noronha, T.F.: Biased random-key genetic algorithm for fiber installation in optical network optimization. In: 2011 IEEE Congress of Evolutionary Computation (CEC), pp. 2267–2271, June 2011Google Scholar
- 27.Molina, D., Lozano, M., Herrera, F.: Memetic algorithm with local search chaining for continuous optimization problems: a scalability test. In: ISDA 2009–9th International Conference on Intelligent Systems Design and Applications, pp. 1068–1073 (2009)Google Scholar
- 31.Schrödinger, LLC: The AxPyMOL molecular graphics plugin for Microsoft PowerPoint, version 1.8, November 2015Google Scholar
- 33.Trott, O., Olson, A.J.: AutoDock Vina: improving the speed and accuracy of docking with a new scoring function, efficient optimization, and multithreading. J. Comput. Chem. 31(2), 455–461 (2010)Google Scholar