By Topic

A solution to protein folding problem using a genetic algorithm with modified keep best reproduction strategy

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

2 Author(s)
Judy, M.V. ; SASTRA Univ., Thanjavur ; Ravichandran, K.S.

Genetic algorithms have proved to be a successful method for predicting the protein structure. In this paper, we propose a new intermediate selection strategy for genetic algorithms and we implement it for protein folding problem. In a standard genetic algorithm the children replace their parents. The idea behind this is that both parents pass on their good genetic material to their children. In practice however, children can have worse fitness than their parents. We therefore propose another intermediate selection step, which we call as modified keep-best reproduction (MKBR) that ensures that new genetic information is entered into the gene pool, as well as good previous genetic material is being preserved. We have demonstrated the superiority of modified keep-best reproduction on several instances of the protein-folding problem, which not only finds the optimum solution, but also finds them faster than the standard generational replacement schemes.

Published in:

Evolutionary Computation, 2007. CEC 2007. IEEE Congress on

Date of Conference:

25-28 Sept. 2007