MICAI 2009: Advances in Artificial Intelligence

Volume 5845 of the series Lecture Notes in Computer Science pp 578-589

MultiQuenching Annealing Algorithm for Protein Folding Problem

  • Juan Frausto-SolisAffiliated withTecnológico de Monterrey
  • , Xavier Soberon-MaineroAffiliated withIBT UNAM
  • , Ernesto Liñán-GarcíaAffiliated withUniversidad Autónoma de Coahuila

* Final gross prices may vary according to local VAT.

Get Access


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.


Peptide Protein Folding Simulated Annealing