By Topic

Protein structure prediction with co-evolving memetic algorithms

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)
Smith, J.E. ; Fac. of Comput., Eng., & Math. Sci., West of England Univ., Bristol, UK

We present a coevolutionary learning-optimisation approach to protein structure prediction which uses a memetic algorithm as its underlying search method. Instance-specific knowledge can be learned, stored and applied by the system in the form of a population of rules. These rules determine the neighbourhoods used by the local search process, which is applied to each member of the coevolving population of candidate solutions. A generic coevolutionary framework is proposed for this approach, and then the implementation of a simple self-adaptive instantiation is described. A rule defining the local search's move operator is encoded as a {condition : action} pair and added to the genotype of each individual. It is demonstrated that the action of mutation and crossover on the patterns encoded in these rules, coupled with the action of selection on the resultant phenotypes is sufficient to permit the discovery and propagation of knowledge about the instance being optimised. The algorithm is benchmarked against a simple genetic algorithm, a memetic algorithm using a fixed neighbourhood function, and a similar memetic algorithm which uses random (rather than evolved) rules and shows significant improvements in terms of the ability to locate optimum configurations using Dill's HP model. It is shown that this "metalearning" of problem features provides a means of creating highly scaleable algorithms.

Published in:

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

Date of Conference:

8-12 Dec. 2003