On the Efficiency of Local Search Methods for the Molecular Docking Problem
EvoBIO '09 Proceedings of the 7th European Conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics
Variable genetic operator search for the molecular docking problem
EvoBIO'10 Proceedings of the 8th European conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics
| Hi-index | 0.00 |
Evolutionary approaches to protein-ligand docking typically use a real-value encoding and mutation operators based on Gaussian and Cauchy distributions. The choice of mutation is important for an efficient algorithm for this problem. We investigate the effect of mutation operators by locality analysis. High locality means that small variations in the genotype imply small variations in the phenotype. Results show that Gaussian-based operators have stronger locality than Cauchy-based ones, especially if an annealing scheme is used to control the variance.