求解蛋白质结构预测问题的局部搜索算法  

Local Search Algorithm for Solving Protein Structure Prediction Problem

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

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

出　　处：《计算机科学》2005年第11期148-149,151,共3页Computer Science

基　　金：国家973计划(批准号:G1998030600)资助项目

摘　　要：蛋白质结构预测问题是计算生物学领域的核心问题之一。通过理论计算的方法根据蛋白质氨基酸序列直接预测其空间结构是解决这一问题的有效途径。构造了新的邻域结构,采用了部分随机跳坑策略,对此问题提出了新的局部搜索算法。计算结果表明,该算法计算效率要优于传统的遗传算法和Monte Carlo方法。对于链长为50的算例还找到了文献中所没有的全新的最低能量构形。Protein structure prediction has proven to be one of the central problems in the field of computational biology. It is a feasible approach to predict theoretically the three-dimensional structure of proteins based only on amino acid sequence information. Using a new neighborhood structure and partly randomized off-trap strategy, a novel local search algorithm for protein structure prediction is proposed. Computational results demonstrate that our algorithm not only is more efficient than conventional genetic and Monte Carlo algorithms, but also find new configurations of lowest energy states missed in orevious papers for the sequence of length N=50

关 键 词：蛋白质结构预测 格点模型 局部搜索 跳坑 局部搜索算法 蛋白质结构 预测问题 CARLO方法 求解 理论计算 

分 类 号：O224[理学—运筹学与控制论] Q510.1[理学—数学]