By Topic

A hybrid genetic algorithm for the 3-D protein structure prediction problem using a path-relinking 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

3 Author(s)
Dorn, M. ; Inst. of Inf., UFRGS, Porto Alegre, Brazil ; Buriol, L.S. ; Lamb, L.C.

One of the main research problems in Structural Bioinformatics is related to the prediction of three-dimensional structures (3-D) of polypeptides or proteins. The rate at which amino acid sequences are identified is increasing faster than the 3-D protein structure determination by experimental methods. Computational prediction methods have been developed during the last years, but the problem still remains challenging because of the complexity and high dimensionality of a protein conformational search space. In this article we present a hybrid genetic algorithm for the Protein Structure Prediction (PSP) Problem. A genetic algorithm is combined with a structured population, and it is hybridized with a path-relinking procedure that helps the algorithm to scape from local minima. We perform a set of experiments and show that the proposed hybrid genetic algorithm is effective in finding good quality solutions for the PSP Problem.

Published in:

Evolutionary Computation (CEC), 2011 IEEE Congress on

Date of Conference:

5-8 June 2011