Molecular docking methods are valuable tools for structure-based drug discovery that can be effectively used to identify promising drug candidates. Solving docking problems is particularly challenging when conformational flexibility is included in the docking model. I will describe one such model, AutoDock, and I will review the hybrid evolutionary algorithms that have been used to successfully solve the challenging docking problems in AutoDock.
Table of ContentsEvolutionary Hybrids for Flexible Ligand Docking Evolutionary Algorithms Overview Evolutionary Algorithms Search Evolutionary Algorithms Main Loop EA Hybrids with Local Search Motivation Hybrid Dynamics Fitness Transformation Hybrid Dynamics Refinement Operator Hybrid Dynamics Repair Operator Flexible Drug Docking Motivation The AutoDock Potential Energy Model Solis-Wets Local Search (contíd) |
Author: William
E. Hart William Hart received a Ph.D. in Computer Science from U.C. San Diego in 1994. Since graduating, he has worked in the Computation, Computers, and Math Center at Sandia National Laboratories, Albuquerque. William has conducted research in diverse areas such as protein structure prediction, parallel optimization and evolutionary algorithms. His work with evolutionary algorithms (EAs) has focused on convergence analyses of EAs on continuous domains, and on hybrid EAs that use local search. |