Skip to Main content Skip to Navigation
Conference papers

Local versus global search strategies in evolutionary grid-based conformational and docking

Dragos Horváth 1 Lorraine Brillet Sylvaine Roy Sébastien Conilleau 2 Alexandru-Adrian Tantar 3 Jean-Charles Boisson 4 Nouredine Melab 4 El-Ghazali Talbi 4
3 ALEA - Advanced Learning Evolutionary Algorithms
Inria Bordeaux - Sud-Ouest, UB - Université de Bordeaux, CNRS - Centre National de la Recherche Scientifique : UMR5251
4 DOLPHIN - Parallel Cooperative Multi-criteria Optimization
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : Conformational sampling, the computational prediction of the experimental geometries of small proteins (folding) or of protein-ligand complexes (docking), is often cited as one of the most challenging multimodal optimization problems. Due to the extreme ruggedness of the energy landscape as a function of geometry, sampling heuristics must rely on an appropriate trade-off between global and local searching efforts. A previously reported ldquoplanetary strategyrdquo, a generalization of the classical island model used to deploy a hybrid genetic algorithm on computer grids, has shown a good ability to quickly discover low-energy geometries of small proteins and sugars, and sometimes even pinpoint their native structures-although not reproducibly. The procedure focused on broad exploration and used a tabu strategy to avoid revisiting the neighborhood of known solutions, at the risk of ldquoburyingrdquo important minima in overhastily set tabu areas. The strategy reported here, termed ldquodivide-and-conquer planetary modelrdquo couples this global search procedure to a local search tool. Grid nodes are now shared between global and local exploration tasks. The phase space is cut into ldquocellsrdquo corresponding to a specified sampling width for each of the N degrees of freedom. Global search locates cells containing low-energy geometries. Local searches pinpoint even deeper minima within a cell. Sampling width controls the important trade-off between the number of cells and the local search effort needed to reproducibly sample each cell. The probability to submit a cell to local search depends on the energy of the most stable geometry found within. Local searches are allotted limited resources and are not expected to converge. However, as long as they manage to discover some deeper local minima, the explored cell remains eligible for further local search, now relying on the improved energy level to enhance chances to be picked again. This competition prevents the system to waste too much effort in fruitless local searches. Eventually, after a limited number of local searches, a cell will be ldquoclosedrdquo and used - first as ldquoseedrdquo, later as tabu zone-to bias future global searches. Technical details and some folding and docking results will be discussed.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-00837532
Contributor : Talbi El-Ghazali <>
Submitted on : Saturday, June 22, 2013 - 6:13:53 PM
Last modification on : Tuesday, June 8, 2021 - 3:28:28 AM

Identifiers

Citation

Dragos Horváth, Lorraine Brillet, Sylvaine Roy, Sébastien Conilleau, Alexandru-Adrian Tantar, et al.. Local versus global search strategies in evolutionary grid-based conformational and docking. CEC 2009 - IEEE Congress on Evolutionary Computation, May 2009, Trondheim, Norway. pp.247-254, ⟨10.1109/CEC.2009.4982955⟩. ⟨hal-00837532⟩

Share

Metrics

Record views

302