Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model

被引:0
|
作者
Agarwala, R
Batzoglou, S
Dancik, V
Decatur, SE
Farach, M
Hannenhalli, S
Skiena, S
机构
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We consider the problem of determining the three-dimensional folding of a protein given its one-dimensional amino acid sequence. We use the HP model for protein folding proposed by Dill [3], which models protein as a chain of amino acid residues that are either hydrophobic or polar, and hydrophobic interactions are the dominant initial driving force for the protein folding, Hart and Istrail [5] gave approximation algorithms for folding proteins on the cubic lattice under HP model. In this paper, we examine the choice of a lattice by considering its algorithmic and geometric implications and argue that triangular lattice is a more reasonable choice. We present a set of folding rules far a triangular lattice and analyze the approximation ratio which they achieve. In addition, we introduce a generalization of the HP model to account for residues having different levels of hydrophobicity. After describing the biological foundation for this generalization, we show that in the new model we are able to achieve similar constant factor approximation guarantees on the triangular lattice as were achieved in the standard HP model. While the structures derived from our folding rules are probably still far from biological reality, we hope that having a set of folding rules with different properties will yield more interesting folds when combined.
引用
收藏
页码:390 / 399
页数:10
相关论文
共 50 条
  • [1] Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model
    Agarwala, R
    Batzoglou, S
    Dancik, V
    Decatur, SE
    Hannenhalli, S
    Farach, M
    Muthukrishnan, S
    Skiena, S
    [J]. JOURNAL OF COMPUTATIONAL BIOLOGY, 1997, 4 (03) : 275 - 296
  • [2] A Local Move Set for Protein Folding in Triangular Lattice Models
    Boeckenhauer, H. -J.
    Ullah, A. Dayem
    Kapsokalivas, L.
    Steinhoefel, K.
    [J]. ALGORITHMS IN BIOINFORMATICS, WABI 2008, 2008, 5251 : 369 - +
  • [3] Fast Tree Search for A Triangular Lattice Model of Protein Folding
    Xiaomei Li and Nengchao Wang Computer Science and Technology Institute
    [J]. Genomics,Proteomics & Bioinformatics, 2004, (04) : 245 - 252
  • [4] A Branch and Bound Algorithm for the Protein Folding Problem in the HP Lattice Model
    Mao Chen* and Wen-Qi HuangSchool of Computer Science and Technology
    [J]. Genomics,Proteomics & Bioinformatics, 2005, (04) : 225 - 230
  • [5] Two local search methods for protein folding simulation in the HP and the MJ lattice models
    Kapsokalivas, L.
    Gan, X.
    Albrecht, A.
    Steinhofel, K.
    [J]. BIOINFORMATICS RESEARCH AND DEVELOPMENT, PROCEEDINGS, 2008, 13 : 167 - +
  • [6] Simple folding model for HP lattice proteins
    Bornberg-Bauer, E
    [J]. BIOINFORMATICS, 1997, 1278 : 125 - 136
  • [7] Local interactions and protein folding:: A model study on the square and triangular lattices
    Irbäck, A
    Sandelin, E
    [J]. JOURNAL OF CHEMICAL PHYSICS, 1998, 108 (05): : 2245 - 2250
  • [8] An effective evolutionary algorithm for protein folding on 3D FCC HP model by lattice rotation and generalized move sets
    Tsay, Jyh-Jong
    Su, Shih-Chieh
    [J]. PROTEOME SCIENCE, 2013, 11
  • [9] An effective evolutionary algorithm for protein folding on 3D FCC HP model by lattice rotation and generalized move sets
    Jyh-Jong Tsay
    Shih-Chieh Su
    [J]. Proteome Science, 11
  • [10] Optimization of protein folding using chemical reaction optimization in HP cubic lattice model
    Islam, Md Rafiqul
    Smrity, Resheta Ahmed
    Chatterjee, Sajib
    Mahmud, Md Riaz
    [J]. NEURAL COMPUTING & APPLICATIONS, 2020, 32 (08): : 3117 - 3134