Effective 3D protein structure prediction with local adjustment genetic-annealing algorithm

The protein folding problem consists of predicting protein tertiary structure from a given amino acid sequence by minimizing the energy function. The protein folding structure prediction is computationally challenging and has been shown to be NP-hard problem when the 3D off-lattice AB model is employed. In this paper, the local adjustment genetic-annealing (LAGA) algorithm was used to search the ground state of 3D offlattice AB model for protein folding structure. The algorithm included an improved crossover strategy and an improved mutation strategy, where a local adjustment strategy was also used to enhance the searching ability. The experiments were carried out with the Fibonacci sequences. The experimental results demonstrate that the LAGA algorithm appears to have better performance and accuracy compared to the previous methods.

[1]  Burkhard Rost,et al.  Using genetic algorithms to select most predictive protein features , 2009, Proteins.

[2]  Liu Xi.  A Genetic Algorithm with Fast Local Adjustment , 2006 .

[3]  C. Anfinsen.  Principles that govern the folding of protein chains. , 1973, Science.

[4]  Xiaolong Zhang,et al.  Genetic-Annealing Algorithm for 3D Off-lattice Protein Folding Model , 2007, PAKDD Workshops.

[5]  Hongbing Zhu,et al.  Structure Optimization by an Improved Tabu Search in the AB Off-Lattice Protein Model , 2008, 2008 First International Conference on Intelligent Networks and Intelligent Systems.

[6]  Xiaolong Zhang,et al.  Protein Folding Prediction Using an Improved Genetic-Annealing Algorithm , 2006, Australian Conference on Artificial Intelligence.

[7]  Hongbing Zhu,et al.  Protein Structure Prediction with EPSO in Toy Model , 2009, 2009 Second International Conference on Intelligent Networks and Intelligent Systems.

[8]  Head-Gordon,et al.  Toy model for protein folding. , 1993, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[9]  Zhang Xiao-yan,et al.  Entropy of knowledge and rough set in ordered information systems , 2007 .

[10]  A. Liwo,et al.  Energy-based de novo protein folding by conformational space annealing and an off-lattice united-residue force field: application to the 10-55 fragment of staphylococcal protein A and to apo calbindin D9K. , 1999, Proceedings of the National Academy of Sciences of the United States of America.

[11]  Frank Potthast,et al.  Local interactions and protein folding: A three-dimensional off-lattice approach , 1997 .

[12]  K. Dill,et al.  A lattice statistical mechanics model of the conformational and sequence spaces of proteins , 1989 .

[13]  Christopher J. Gatti,et al.  Optimization of Muscle Wrapping Objects Using Simulated Annealing , 2009, Annals of Biomedical Engineering.

[14]  Faming Liang,et al.  Annealing contour Monte Carlo algorithm for structure optimization in an off-lattice protein model. , 2004, The Journal of chemical physics.

[15]  Jooyoung Lee,et al.  Structure optimization by conformational space annealing in an off-lattice protein model. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Feng Shi,et al.  Analysis of Toy Model for Protein Folding Based on Particle Swarm Optimization Algorithm , 2005, ICNC.

[17]  Wolfhard Janke,et al.  Multicanonical study of coarse-grained off-lattice models for folding heteropolymers. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  John Lygeros,et al.  Simulated Annealing: Rigorous finite-time guarantees for optimization on continuous domains , 2007, NIPS.

[19]  Ling Wang,et al.  A Hybrid Quantum-Inspired Genetic Algorithm for Multiobjective Flow Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[20]  Head-Gordon,et al.  Collective aspects of protein folding illustrated by a toy model. , 1995, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.