Emergent Protein Folding Modeled with Evolved Neural Cellular Automata Using the 3D HP Model

被引:12
作者
Santos, Jose [1 ]
Villot, Pablo [1 ]
Dieguez, Martin [1 ]
机构
[1] Univ A Coruna, Dept Comp Sci, La Coruna 15071, Spain
关键词
STRUCTURE PREDICTION; GENETIC ALGORITHM; DIFFERENTIAL EVOLUTION; OPTIMIZATION; PACKING; 2D;
D O I
10.1089/cmb.2014.0077
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
We used cellular automata (CA) for the modeling of the temporal folding of proteins. Unlike the focus of the vast research already done on the direct prediction of the final folded conformations, we will model the temporal and dynamic folding process. To reduce the complexity of the interactions and the nature of the amino acid elements, lattice models like HP were used, a model that categorizes the amino acids regarding their hydrophobicity. Taking into account the restrictions of the lattice model, the CA model defines how the amino acids interact through time to obtain a folded conformation. We extended the classical CA models using artificial neural networks for their implementation (neural CA), and we used evolutionary computing to automatically obtain the models by means of Differential Evolution. As the iterative folding also provides the final folded conformation, we can compare the results with those from direct prediction methods of the final protein conformation. Finally, as the neural CA that provides the iterative folding process can be evolved using several protein sequences and used as operators in the folding of another protein with different length, this represents an advantage over the NP-hard complexity of the original problem of the direct prediction.
引用
收藏
页码:823 / 845
页数:23
相关论文
共 61 条
[1]  
[Anonymous], 2001, CELLULAR AUTOMATA A, DOI DOI 10.1142/4702
[2]   Residue coordination in proteins conforms to the closest packing of spheres [J].
Bagci, Z ;
Jernigan, RL ;
Bahar, I .
POLYMER, 2002, 43 (02) :451-459
[3]   Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete [J].
Berger, B ;
Leighton, T .
JOURNAL OF COMPUTATIONAL BIOLOGY, 1998, 5 (01) :27-40
[4]  
BLAZEWICZ J, 2004, COMPUTATIONAL METHOD, V10, P7
[5]   SIDE-CHAIN ENTROPY AND PACKING IN PROTEINS [J].
BROMBERG, S ;
DILL, KA .
PROTEIN SCIENCE, 1994, 3 (07) :997-1009
[6]  
Calabretta R, 1995, LECT NOTES ARTIF INT, V929, P862
[7]  
Cotta C, 2003, LECT NOTES COMPUT SC, V2687, P321
[8]   Development and optimisation of a novel genetic algorithm for studying model protein folding [J].
Cox, GA ;
Mortimer-Jones, TV ;
Taylor, RP ;
Johnston, RL .
THEORETICAL CHEMISTRY ACCOUNTS, 2004, 112 (03) :163-178
[9]   On the complexity of protein folding [J].
Crescenzi, P ;
Goldman, D ;
Papadimitriou, C ;
Piccolboni, A ;
Yannakakis, M .
JOURNAL OF COMPUTATIONAL BIOLOGY, 1998, 5 (03) :423-465
[10]   Investigation of the three-dimensional lattice HP protein folding model using a genetic algorithm [J].
Custódio, FL ;
Barbosa, HJC ;
Dardenne, LE .
GENETICS AND MOLECULAR BIOLOGY, 2004, 27 (04) :611-615