A Self-adaptive Local Search Coordination in Multimeme Memetic Algorithm for Molecular Docking
Molecular Docking is a methodology that deals with the problem of predicting the non-covalent binding of a receptor and a ligand at an atomic level to form a stable complex. Because the search space of possible conformations is vast, molecular docking is classified in computational complexity theory as a NP-hard problem. Because of the high complexity, exact methods are not efficient and several metaheuristics have been proposed. However, these methods are very dependent on parameter settings and search mechanism definitions, which requires approaches able to self-adapt these configurations along the optimization process. We proposed and developed a novel self-adaptive coordination of local search operators in a Multimeme Memetic Algorithm. The approach is based on the Biased Random Key Genetic Algorithm enhanced with four local search algorithms. The self-adaptation of methods and radius perturbation in local improvements works under a proposed probability function, which measures their performance to best guide the search process. The methods have been tested on a test set based on HIV-protease and compared to existing tools. Statistical test performed on the results shows that this approach reaches better results than a non-adaptive algorithm and is competitive with traditional methods.
KeywordsSelf-adaptation Multimeme Memetic Algorithms Molecular docking
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 CAPES - Finance Code 001.
- 1.Jin, X., Zhihua, C., Wenyin, G.: An adaptive strategy to adjust the components of memetic algorithms. In: 2014 IEEE 26th International Conference on Tools with Artificial Intelligence, pp. 55–62, November 2014Google Scholar
- 5.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
- 9.Rosin, C.D., Halliday, R.S., Hart, W.E., Belew, R.K.: A comparison of global and local search methods in drug docking. In: In Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 221–228. Morgan Kaufmann (1997)Google Scholar
- 10.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
- 11.Leonhart, P.F., Spieler, E., Braun, R., Dorn, M.: A biased random key genetic algorithm for the proteinligand docking problem. Soft Comput. 23, 1–22 (2018)Google Scholar
- 12.Krasnogor, N.: Studies on the theory and design space of memetic algorithms. Ph.D. thesis, University of the West of England (2002)Google Scholar
- 15.Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts - towards memetic algorithms (1989)Google Scholar
- 21.Krasnogor, N., Smith, J.: Emergence of profitable search strategies based on a simple inheritance mechanism (2001)Google Scholar
- 22.Jakob, W.: Towards an adaptive multimeme algorithm for parameter optimisation suiting the engineers’ needs. In: Runarsson, T.P., Beyer, H.-G., Burke, E., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 132–141. Springer, Heidelberg (2006). https://doi.org/10.1007/11844297_14CrossRefGoogle Scholar