求解蛋白质折叠问题的改进PERM算法  

An improved pruned-enriched-rosenbluth method for protein folding

作　　者：黄文奇[1] 程念华[1] 吕志鹏[1] 

机构地区：[1]华中科技大学计算机科学与技术学院,湖北武汉430074

出　　处：《华中科技大学学报（自然科学版）》2004年第7期1-3,共3页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家高技术研究发展计划资助项目 (G1 9980 30 6 0 0 ) ;湖北省咸宁市白云山林场开发基金资助项目

摘　　要：在学习PERM算法的基础上 ,指出了影响PERM算法效率的关键因素 ,进而提出了一种改进的PERM算法———IPERM (ImprovedPERM ) .计算结果表明 ,IPERM的计算效率优于PERM算法 。In this article the factors affecting the efficiency of PERM were pointed and an improved version of PERM IPERM was proposed. In all test cases, the numerical results demonstrated that IPERM outperformed PERM and it was far more efficient than all other fully blind general purpose stochastic algorithms, such as Multi Self Overlap Ensemble(MSOE) and Sequential Importance Sampling with Pilot Exploration(SISPER).

关 键 词：蛋白质折叠 PERM IPERM 门限 裁减 

分 类 号：TP393.04[自动化与计算机技术—计算机应用技术]