A genetic algorithm for energy minimization in bio-molecular systems

Document Type

Conference Proceeding

Date of Original Version

10-31-2005

Abstract

Energy minimization algorithms for biomolecular systems are critical to applications such as the prediction of protein folding. Conventional energy minimization methods such as the steepest descent method and conjugate gradient method suffer from the drawback that they can only locate energy minima that are extremely dependent on the initial parameter settings of the computation. Here we present an energy minimization algorithm based on genetic algorithms that largely overcomes this drawback of conventional methods because it provides a effective mechanism, through crossover and mutation, to explore new regions of the parameter space without being dependent on a single, preselected parameter setting. This allows the algorithm to cross local energy barriers not surmountable by conventional methods. The algorithm significantly increases the probability of reaching deeper energy minima. Tests show that the genetic algorithm based approach can achieve much lower final energy than conventional methods. Our genetic algorithm approach differs from other genetic algorithm based approaches in that we do not use the genetic algorithm to directly compute molecular conformations but instead compute a set of parameters to be used in conjunction with the molecular dynamics simulation package GROMOS96. © 2005 IEEE.

Publication Title, e.g., Journal

2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings

Volume

1

This document is currently not available here.

Share

COinS