MultiQuenching Annealing Algorithm for Protein Folding Problem

This paper presents a new approach named MultiQuenching Annealing (MQA) for the Protein Folding Problem (PFP). MQA has two phases: Quenching Phase (QP) and Annealing Phase (AP). QP is applied at extremely high temperatures when the higher energy variations can occur. AP searches for the optimal solution at high and low temperatures when the energy variations are not very high. The temperature during the QP is decreased by an exponential function. Both QP and AP are divided in several sub-phases to decrease the temperature parameter until a dynamic equilibrium is detected by measuring its quality solution. In addition, an efficient analytical method to tune the algorithm parameters is used. Experimentation presented in the paper shows that MQA can obtain high quality of solution for PFP.

[1]  C. Levinthal.  Are there pathways for protein folding , 1968 .

[2]  Antonio Laganà,et al.  Computational Science and Its Applications – ICCSA 2004 , 2004, Lecture Notes in Computer Science.

[3]  Juan Frausto Solís,et al.  ANDYMARK: An Analytical Method to Establish Dynamically the Length of the Markov Chain in Simulated Annealing for the Satisfiability Problem , 2006, SEAL.

[4]  Jack Dongarra,et al.  Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part III , 2007, ICCS.

[5]  Ulrich H. E. Hansmann,et al.  An enhanced version of SMMP - open-source software package for simulation of proteins , 2006, Comput. Phys. Commun..

[6]  Juan Frausto-Solís,et al.  A Method to Establish the Cooling Scheme in Simulated Annealing Like Algorithms , 2004 .

[7]  D. Romero,et al.  Applications of simulated annealing to the multiple-minima problem in small peptides. , 1991, Journal of biomolecular structure & dynamics.

[8]  Lamberto Cesari,et al.  Optimization-Theory And Applications , 1983 .

[9]  Juan Frausto Solís,et al.  Solving SAT Problems with TA Algorithms Using Constant and Dynamic Markov Chains Length , 2005, AAIM.

[10]  R Garduño-Juárez,et al.  The multiple-minima problem in small peptides revisited. The Threshold Accepting approach. , 1992, Journal of biomolecular structure & dynamics.

[11]  Juan Frausto Solís,et al.  Analytically Tuned Simulated Annealing Applied to the Protein Folding Problem , 2007, International Conference on Computational Science.

[12]  The simulated annealing method applied to protein structure prediction , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[13]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[14]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[15]  Ulrich H. E. Hansmann,et al.  SMMP) A modern package for simulation of proteins , 2001 .

[16]  D. Romero,et al.  Heuristic methods in conformational space search of peptides , 1994 .

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