Abstract
This paper presents a model used to deal with three-dimensional off-lattice AB protein folding. The model is extended from genetic-annealing algorithm that is for the two-dimensional off-latticeAB protein model. The three-dimensional model also has only two types of residues, hydrophobic and hydrophilic. Based on a physical model, the problem is converted from a nonlinear constraint-satisfied problem to an unconstrained optimization problem. Also, in contrast to earlier studies using off-lattice AB models, our results demonstrate that the proposed methods are very promising for searching the ground states of protein folding in three dimensions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anfinsen, C.B.: Principles that govern the folding of protein chains. Science 181, 223 (1973)
Kim, S.-Y., Lee, S.B., Lee, J.: Structure optimization by conformational space annealing in an off-lattice protein model. Phys. Rev. E 72, 011916 (2005)
Bachmann, M., Arkin, H., Janke, W.: Multicanonical study of coarse-grained off-lattice models for folding heteropolymers. Phys. Rev. E 71, 031906 (2005)
Hsu, H.-P., Mehra, V., Grassberger, P.: Structure optimization in an off-lattice protein model. Phys. Rev. E 68, 037703 (2003)
Lau, K.F., Dill, K.A.: A lattice statistical mechanics model of the conformational and sequence space of proteins. Macromolecules 22, 3986 (1989)
Stillinger, F.H., Head-Gordon, T., Hirshfel, C.L.: Toy model for protein folding. Physical review, E 48, 1469–1477 (1993)
Zhang, X., Lin, X.: Protein folding prediction using an improved genetic-annealing algorithm. Proceedings of the 19th Australian Joint Conference on Artificial Intelligence (2006)
Zhang, X., Lin, X.: Effective protein folding prediction based on genetic- annealing algorithm in Toy model. In: 2006 Workshop on Intelligent Computing & Bioinformatics of CAS (2006)
Irback, A., Peterson, C., Potthast, F., Sommelius, O.: Local interactions and protein folding: A 3D off-lattice approach. J. Chem. Phys. 107, 273 (1997)
Forrest, S.: Genetic algorithms: Principles of natural selection applied to computation. Science 261 (1993)
Dandekar, T., Argos, P.: Potential of genetic algorithms in protein folding and protein engineering simulations. Protein Engineering 5(7), 637 (1992)
Meza, J.C., Judson, R.S., Faulkner, T.R., Treasurywala, A.M.: A comparison of a direct search method and a genetic algorithm for conformational searching. Journal of Computational Chemistry 17(9), 1142 (1996)
Eglese, R.W.: Simulated annealing: A tool for operational research. European Journal of Operational Research 46, 271 (1990)
Liu, X., Yu, S.: A genetic algorithm with fast local adjustment. Chinese Journal of Computers 29, 100 (2006)
Stillinger, F.H.: Collective aspects of protein folding illustrated by a toy model. Physical Review, E 52, 2872 (1995)
Liang, F.: Annealing contour Monte Carlo algorithm for structure optimization in an off-lattice protein model. J.Chem. Phys. 120, 6756 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, X., Lin, X., Wan, C., Li, T. (2007). Genetic-Annealing Algorithm for 3D Off-lattice Protein Folding Model. In: Washio, T., et al. Emerging Technologies in Knowledge Discovery and Data Mining. PAKDD 2007. Lecture Notes in Computer Science(), vol 4819. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77018-3_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-77018-3_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77016-9
Online ISBN: 978-3-540-77018-3
eBook Packages: Computer ScienceComputer Science (R0)