预测蛋白质折叠结构的剪枝算法  

Pruning algorithm for predicting the protein folding structure prediction

作　　者：陈昊[1] 王代萍[2] 

机构地区：[1]湖北大学数学与计算机科学学院,湖北武汉430062 [2]湖北大学知行学院,湖北武汉430011

出　　处：《湖北大学学报（自然科学版）》2010年第1期37-41,共5页Journal of Hubei University：Natural Science

摘　　要：为求解蛋白质折叠结构预测问题提出一种基于剪枝策略的启发式搜索算法.剪枝算法用一棵搜索树描述蛋白质构形的生长过程,通过定义权重、上下门槛制定一套有效的控制分支繁殖的规则,从而极大地提高了搜索的效率.采用国际文献公认的10个算例作为剪枝算法的实验测试集,并与目前国际上4个著名的算法进行比较,实验比较结果表明剪枝算法是一个高效的求解算法.A new heuristic algorithm based on pruning strategy was proposed for solving the problem of the protein folding structure prediction.Pruning algorithm used a searching tree describe the growth processes of a protein configuration and set out a suit of effective rules in order to prune less qualified branches.The results were shown that the search efficiency was improved largely.We applyed the proposed algorithms to the 10 standard benchmark instances from the literature,and the effectiveness of pruning algorithm was demonstrated through comparing computational results with other four famous algorithms.

关 键 词：格点模型 NP难问题 剪枝策略 权重 构形 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]