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.
CITATION STYLE
Leonhart, P. F., & Dorn, M. (2019). A biased random key genetic algorithm with local search chains for molecular docking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11454 LNCS, pp. 360–376). Springer Verlag. https://doi.org/10.1007/978-3-030-16692-2_24
Mendeley helps you to discover research relevant for your work.