By Topic

Mapping of Genetic Algorithms for Protein Folding onto Computational Grids

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)
Weiguo Liu ; Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore ; Schmidt, B.

Computational biology research is now faced with the burgeoning number of genome data. The rigorous postprocessing of this data requires an increased role for high performance computing. In this paper, we present a framework to map hierarchical genetic algorithms for protein folding problems onto computational grids. It has been designed to take advantage of the communication characteristics of a computational grid. By using this framework, the two level communication parts of hierarchical genetic algorithms are separated. Thus both parts of the algorithm can evolve independently. This permits users to experiment with alternative communication models on different levels conveniently. Our experiments show that it can lead to significant runtime savings on PC clusters and computational grids.

Published in:

TENCON 2005 2005 IEEE Region 10

Date of Conference:

21-24 Nov. 2005