Cluster Perturbation Simulated Annealing for Protein Folding Problem.
JOURNAL OF UNIVERSAL COMPUTER SCIENCE(2013)
摘要
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.
更多查看译文
关键词
Simulated Annealing,Protein Folding,Tuned SA,Cluster Perturbation Simulated Annealing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络