A combined algorithm to the 2D lattice model for protein folding Online publication date: Fri, 02-Jul-2010
by Hengyun Lu, Genke Yang, Lam Fat Yeung
International Journal of Modelling, Identification and Control (IJMIC), Vol. 10, No. 1/2, 2010
Abstract: This paper presents a novel search strategy for protein folding by combining genetic algorithm (GA) with extremal optimisation (EO). In the proposed algorithm, a constrained structure is proposed to reduce the complexity of algorithm. EO quickly approaches near-optimal solutions and GA generates an improved generation of global approximations. We demonstrate that the marriage of GA and EO can be applied successfully to the protein folding problem. The results show that the algorithm can find these best solutions so far for the listed benchmarks. Within the achieved results, the search converged rapidly and efficiently.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Modelling, Identification and Control (IJMIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com