A Simulating Algorithm for Protein Folding Process

Author

Zhang, Jing ; Li, Song

Author_Institution

Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin

Volume

3

fYear

2009

fDate

6-8 Jan. 2009

Firstpage

343

Lastpage

347

Abstract

It is a difficult problem of studying the protein folding process in the protein research field. In this paper, a new simulation algorithm-snake simulation algorithm is put forward to solve the problem. In order to prove the key function in snake simulation algorithm is correct and feasible, theory of molecule oscillation and molecule kinetics are used. In addition, bring forward a model that describes the process of protein folding, concludes that all the protein structure can be constructed by two type functions. Compared with other five protein folding algorithms, the snake simulation algorithm has a great advantage in the energy and similar of protein structure.

Keywords

biology computing; molecular biophysics; proteins; protein folding process; protein research field; protein structure; simulation algorithm-snake simulation algorithm; Ant colony optimization; Biological cells; Biological system modeling; Computational modeling; Computer science; Computer simulation; Educational institutions; Genetics; Kinetic theory; Protein engineering; Protein folding; molecule oscillation; protein folding algorithm; protein folding model;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications and Mobile Computing, 2009. CMC '09. WRI International Conference on

Conference_Location

Yunnan

Print_ISBN

978-0-7695-3501-2

Type

conf

DOI

10.1109/CMC.2009.351

Filename

4797274