loading...
A Novel Genetic Algorithm for HP Model Protein Folding
Dalian, China December 05-December 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.31Sixth International Conference on Par ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Jie Song, Anhui University, Ministry of Education,China
Jiaxing Cheng, Anhui University, Ministry of Education,China
TingTing Zheng, Anhui University, Ministry of Education,China
Junjun mao, Anhui University, Ministry of Education,China
Determination of the native state of a protein from its amino acid sequence is the goal of protein folding simulations, with potential applications in gene therapy and drug design. To predict a global minimum (GM) structure of a given sequence is a difficult task. A genetic algorithm (GA) is an efficient approach to find lowest-energy conformation for HP lattice model. We have introduced some new operators (symmetric and cornerchange operators) to speed up the searching process and give the result more biology significance. The result shows these new operators improved the success of prediction, compared with standard GA for benchmark HP sequence up to 50 residues
Citation:
Jie Song, Jiaxing Cheng, TingTing Zheng, Junjun mao, "A Novel Genetic Algorithm for HP Model Protein Folding," pdcat, pp.935-937, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.