Analytically Tuned Simulated Annealing Applied to the Protein Folding Problem
- Cite this paper as:
- Frausto-Solis J., Román E.F., Romero D., Soberon X., Liñán-García E. (2007) Analytically Tuned Simulated Annealing Applied to the Protein Folding Problem. In: Shi Y., van Albada G.D., Dongarra J., Sloot P.M.A. (eds) Computational Science – ICCS 2007. ICCS 2007. Lecture Notes in Computer Science, vol 4488. Springer, Berlin, Heidelberg
In this paper a Simulated Annealing algorithm (SA) for solving the Protein Folding Problem (PFP) is presented. This algorithm has two phases: quenching and annealing. The first phase is applied at very high temperatures and the annealing phase is applied at high and low temperatures. The temperature during the quenching phase is decreased by an exponential function. We run through an efficient analytical method to tune the algorithm parameters. This method allows the change of the temperature in accordance with solution quality, which can save large amounts of execution time for PFP.
KeywordsPeptide Protein Folding Simulated Annealing
Unable to display preview. Download preview PDF.