Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function

Abstract

ABSTRACT: A novel and robust automated docking method that predicts the bound conformations of flexible ligands to macromolecular targets has been developed and tested, in combination with a new scoring function that estimates the free energy change upon binding. Interestingly, this method applies a Lamarckian model of genetics, in which environmental adaptations of an individual’s phenotype are reverse transcribed into its genotype and become .heritable traits sic. We consider three search methods, Monte Carlo simulated annealing, a traditional genetic algorithm, and the Lamarckian genetic algorithm, and compare their performance in dockings of seven protein]ligand test systems having known three-dimensional structure. We show that both the traditional and Lamarckian genetic algorithms can handle ligands with more degrees of freedom than the simulated annealing method used in earlier versions of AUTODOCK, and that the Lamarckian genetic algorithm is the most efficient, reliable, and successful of the three. The empirical free energy function was calibrated using a set of 30 structurally known protein]ligand complexes with

Keywords

Affiliated Institutions

• Sandia National Laboratories US
• Scripps Research Institute US
• Hewlett-Packard (United States) US
• University of California, San Diego US

Related Publications