The Community for Technology Leaders
Parallel and Distributed Computing Applications and Technologies, International Conference on (2005)
Dalian, China
Dec. 5, 2005 to Dec. 8, 2005
ISBN: 0-7695-2405-2
pp: 935-937
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
ABSTRACT
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
INDEX TERMS
null
CITATION

J. Cheng, T. Zheng, J. Song and J. mao, "A Novel Genetic Algorithm for HP Model Protein Folding," Parallel and Distributed Computing Applications and Technologies, International Conference on(PDCAT), Dalian, China, 2005, pp. 935-937.
doi:10.1109/PDCAT.2005.31
91 ms
(Ver 3.3 (11022016))