A Branch and Bound Algorithm for the Protein Folding Problem in the HP Lattice Model

被引：0

作者：

Mao Chen and WenQi HuangSchool of Computer Science and Technology Huazhong University of Science and Technology Wuhan China ^{[430074
]}

机构：

来源：

Genomics Proteomics & Bioinformatics | 2005年 / 04期

关键词：

protein folding; HP model; branch and bound; lattice;

D O I：

暂无

中图分类号：

Q51-33 [];

学科分类号：

071010 ; 081704 ;

摘要：

A branch and bound algorithm is proposed for the two-dimensional protein foldingproblem in the HP lattice model. In this algorithm, the benefit of each possiblelocation of hydrophobic monomers is evaluated and only promising nodes are keptfor further branching at each level. The proposed algorithm is compared withother well-known methods for 10 benchmark sequences with lengths ranging from20 to 100 monomers. The results indicate that our method is a very efficient andpromising tool for the protein folding problem.

引用

页码：225 / 230

页数：6