MultiQuenching annealing algorithm for protein folding problem

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Frausto-Solis, J., Soberon-Mainero, X., & Liñán-García, E. (2009). MultiQuenching annealing algorithm for protein folding problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5845 LNAI, pp. 578–589). https://doi.org/10.1007/978-3-642-05258-3_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free