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

作　　者：Mao Chen Wen-Qi Huang 

机构地区：[1]School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074,China.

出　　处：《Genomics, Proteomics & Bioinformatics》2005年第4期225-230,共6页基因组蛋白质组与生物信息学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(No.10471051);the National Basic Research Program(973 Program)of China(No.2004CB318000)

摘　　要：A branch and bound algorithm is proposed for the two-dimensional protein folding problem in the HP lattice model. In this algorithm, the benefit of each possible location of hydrophobic monomers is evaluated and only promising nodes are kept for further branching at each level. The proposed algorithm is compared with other well-known methods for 10 benchmark sequences with lengths ranging from 20 to 100 monomers. The results indicate that our method is a very efficient and promising tool for the protein folding problem.A branch and bound algorithm is proposed for the two-dimensional protein folding problem in the HP lattice model. In this algorithm, the benefit of each possible location of hydrophobic monomers is evaluated and only promising nodes are kept for further branching at each level. The proposed algorithm is compared with other well-known methods for 10 benchmark sequences with lengths ranging from 20 to 100 monomers. The results indicate that our method is a very efficient and promising tool for the protein folding problem.

关 键 词：protein folding HP model branch and bound LATTICE 

分 类 号：R512.99[医药卫生—内科学]