Improved PERM Algorithm of Protein Folding Simulations
Xiao Li · 2007
PERM is the most efficient aproach for protein folding problem in lattice model. In this paper we ppresent an improved growth algorithm which simplify the calculation of weight when choosing different branches and apply different upper thresholds according to different type of monomers. The experiment results show that the improved growth algorithm can find the knwon lowest ground state faster for the given HP sepquences in square lattive model.