Chaotic multiquenching annealing applied to the protein folding problem.
The Chaotic Multiquenching Annealing algorithm (CMQA) is proposed. CMQA is a new algorithm, which is applied to protein folding problem (PFP). This algorithm is divided into three phases: (i) multiquenching phase (MQP), (ii) annealing phase (AP), and (iii) dynamical equilibrium phase (DEP). MQP enforces several stages of quick quenching processes that include chaotic functions. The chaotic functions can increase the exploration potential of solutions space of PFP. AP phase implements a simulated annealing algorithm (SA) with an exponential cooling function. MQP and AP are delimited by different ranges of temperatures; MQP is applied for a range of temperatures which goes from extremely high values to very high values; AP searches for solutions in a range of temperatures from high values to extremely low values. DEP phase finds the equilibrium in a dynamic way by applying least squares method. CMQA is tested with several instances of PFP.
Universidad Politécnica del Estado de Morelos Boulevard, Cuauhnáhuac 566, 62660 Jiutepec, Mexico.
Juan
0000-0001-9307-0734
J
Frausto-Solis
Universidad Autónoma de Coahuila Boulevard, Venustiano Carranza s/n, 25280 Saltillo, Mexico.
Ernesto
E
Liñan-García
Computational Genomics Research Program, Center for Genomic Sciences, Universidad Nacional Autónoma de México, Avenida Universidad s/n, 62210 Cuernavaca, Mexico.
Mishael
M
Sánchez-Pérez
Universidad Politécnica del Estado de Morelos Boulevard, Cuauhnáhuac 566, 62660 Jiutepec, Mexico ; Instituto Tecnológico y de Estudios Superiores de Monterrey, Autopista del Sol, 62790 Xochitepec, Mexico.
Juan Paulo
JP
Sánchez-Hernández
D000465:Algorithms; D008962:Models, Theoretical; D017510:Protein Folding; D011506:Proteins / Q000737:chemistry*; D013816:Thermodynamics
D011506:Proteins