By Topic

Flexible ligand docking using differential evolution

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Thomsen, R. ; Dept. of Comput. Sci., Aarhus Univ., Denmark

Molecular docking of biomolecules is becoming an increasingly important part in the process of developing new drugs, as well as searching compound databases for promising drug candidates. The docking of ligands to proteins can be formulated as an optimization problem where the task is to find the most favorable energetic conformation among the large space of possible protein-ligand complexes. Stochastic search methods, such as evolutionary algorithms (EAs), can be used to sample large search spaces effectively and is one of the preferred methods for flexible ligand docking. The differential evolution algorithm (DE) is applied to the docking problem using the AutoDock program. The introduced DockDE algorithm is compared with the Lamarckian GA (LGA) provided with AutoDock, and the DockEA previously found to outperform the LGA. The comparison is performed on a suite of six commonly used docking problems. In conclusion, the introduced DockDE outperformed the other algorithms on all problems. Further, the DockDE showed remarkable performance in terms of convergence speed and robustness regarding the found solution.

Published in:

Evolutionary Computation, 2003. CEC '03. The 2003 Congress on  (Volume:4 )

Date of Conference:

8-12 Dec. 2003