On the Characterization and Software Implementation of General Protein Lattice Models

被引:12
作者
Bechini, Alessio [1 ]
机构
[1] Univ Pisa, Dept Informat Engn, Pisa, Italy
关键词
MONTE-CARLO; FOLDING SIMULATION; HP; ALGORITHM; SEARCH; PREDICTION;
D O I
10.1371/journal.pone.0059504
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
The Abstract models of proteins have been widely used as a practical means to computationally investigate general properties of the system. In lattice models any sterically feasible conformation is represented as a self-avoiding walk on a lattice, and residue types are limited in number. So far, only two- or three-dimensional lattices have been used. The inspection of the neighborhood of alpha carbons in the core of real proteins reveals that also lattices with higher coordination numbers, possibly in higher dimensional spaces, can be adopted. In this paper, a new general parametric lattice model for simplified protein conformations is proposed and investigated. It is shown how the supporting software can be consistently designed to let algorithms that operate on protein structures be implemented in a lattice-agnostic way. The necessary theoretical foundations are developed and organically presented, pinpointing the role of the concept of main directions in lattice-agnostic model handling. Subsequently, the model features across dimensions and lattice types are explored in tests performed on benchmark protein sequences, using a Python implementation. Simulations give insights on the use of square and triangular lattices in a range of dimensions. The trend of potential minimum for sequences of different lengths, varying the lattice dimension, is uncovered. Moreover, an extensive quantitative characterization of the usage of the so-called "move types'' is reported for the first time. The proposed general framework for the development of lattice models is simple yet complete, and an object-oriented architecture can be proficiently employed for the supporting software, by designing ad-hoc classes. The proposed framework represents a new general viewpoint that potentially subsumes a number of solutions previously studied. The adoption of the described model pushes to look at protein structure issues from a more general and essential perspective, making computational investigations over simplified models more straightforward as well.
引用
收藏
页数:19
相关论文
共 61 条
[21]   Approximate protein folding in the HP side chain model on extended cubic lattices [J].
Heun, V .
DISCRETE APPLIED MATHEMATICS, 2003, 127 (01) :163-177
[22]   ANALYSIS OF MONTE-CARLO RESULTS ON KINETICS OF LATTICE POLYMER-CHAINS WITH EXCLUDED VOLUME [J].
HILHORST, HJ ;
DEUTCH, JM .
JOURNAL OF CHEMICAL PHYSICS, 1975, 63 (12) :5153-5161
[23]   EXPLORING CONFORMATIONAL SPACE WITH A SIMPLE LATTICE MODEL FOR PROTEIN-STRUCTURE [J].
HINDS, DA ;
LEVITT, M .
JOURNAL OF MOLECULAR BIOLOGY, 1994, 243 (04) :668-682
[24]   Protein folding prediction in 3D FCCHP lattice model using genetic algorithm [J].
Hoque, Md Tamjidul ;
Chetty, Madhu ;
Sattar, Abdul .
2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, :4138-+
[25]   A New Branch and Bound Method for the Protein Folding Problem Under the 2D-HP Model [J].
Hsieh, Sun-Yuan ;
Lai, De-Wei .
IEEE TRANSACTIONS ON NANOBIOSCIENCE, 2011, 10 (02) :69-75
[26]   Growth-based optimization algorithm for lattice heteropolymers [J].
Hsu, HP ;
Mehra, V ;
Nadler, W ;
Grassberger, P .
PHYSICAL REVIEW E, 2003, 68 (02)
[27]   Different mechanistic requirements for prokaryotic and eukaryotic chaperonins: a lattice study [J].
Jacob, Etai ;
Horovitz, Amnon ;
Unger, Ron .
BIOINFORMATICS, 2007, 23 (13) :I240-I248
[28]   A tale of two tails: why are terminal residues of proteins exposed? [J].
Jacob, Etai ;
Unger, Ron .
BIOINFORMATICS, 2007, 23 (02) :E225-E230
[29]  
Jiang Minghui, 2005, Journal of Bioinformatics and Computational Biology, V3, P19, DOI 10.1142/S0219720005000850
[30]  
Jiang MH, 2007, LECT N BIOINFORMAT, V4463, P518