文章基本信息

标题：Cluster Perturbation Simulated Annealing for Protein Folding Problem
本地全文：下载
作者：Juan Frausto-Solís ; Mishael Sánchez-Pérez ; Ernesto Liñan-García 等
期刊名称：Journal of Universal Computer Science
印刷版ISSN：0948-6968
出版年度：2013
卷号：19
期号：15
页码：2207-2233
出版社：Graz University of Technology and Know-Center
摘要：In this paper, an improved Simulated Annealing algorithm for Protein Folding Problem (PFP) is presented. This algorithm called Cluster Perturbation Simulated Annealing (CPSA) is based on a brand new scheme to generate new solutions using a cluster perturbation. The algorithm is divided into two phases: Cluster Perturbation Phase and the Reheat Phase. The first phase obtains a good solution in a small amount of time, and it is applied at very high temperatures. The second phase starts with a threshold temperature and reheats the system for a better exploration. CPSA reduces the execution time of the Simulated Annealing Algorithm without sacrificing quality to find a native structure in PFP in Ab-Initio approaches.