Multiobjective evolutionary algorithm with many tables for purely ab initio protein structure prediction

被引:22
作者
Soares Brasil, Christiane Regina [1 ]
Botazzo Delbem, Alexandre Claudio [1 ]
Barroso da Silva, Fernando Luis [2 ]
机构
[1] Univ Sao Paulo, Comp Sci & Math Inst, Sao Carlos, SP, Brazil
[2] Univ Sao Paulo, Dept Phys & Chem, BR-14049 Ribeirao Preto, SP, Brazil
基金
巴西圣保罗研究基金会;
关键词
interaction energy model; evolutionary algorithms; purely ab initio prediction; multiobjective optimization; many objectives; GENETIC ALGORITHM; I-TASSER; SECONDARY STRUCTURE; MOLECULAR-DYNAMICS; BETA-HAIRPINS; OPTIMIZATION; ENERGY; SIMULATION; BINDING; MODELS;
D O I
10.1002/jcc.23315
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
This article focuses on the development of an approach for ab initio protein structure prediction (PSP) without using any earlier knowledge from similar protein structures, as fragment-based statistics or inference of secondary structures. Such an approach is called purely ab initio prediction. The article shows that well-designed multiobjective evolutionary algorithms can predict relevant protein structures in a purely ab initio way. One challenge for purely ab initio PSP is the prediction of structures with -sheets. To work with such proteins, this research has also developed procedures to efficiently estimate hydrogen bond and solvation contribution energies. Considering van der Waals, electrostatic, hydrogen bond, and solvation contribution energies, the PSP is a problem with four energetic terms to be minimized. Each interaction energy term can be considered an objective of an optimization method. Combinatorial problems with four objectives have been considered too complex for the available multiobjective optimization (MOO) methods. The proposed approach, called Multiobjective evolutionary algorithms with many tables (MEAMT), can efficiently deal with four objectives through the combination thereof, performing a more adequate sampling of the objective space. Therefore, this method can better map the promising regions in this space, predicting structures in a purely ab initio way. In other words, MEAMT is an efficient optimization method for MOO, which explores simultaneously the search space as well as the objective space. MEAMT can predict structures with one or two domains with RMSDs comparable to values obtained by recently developed ab initio methods (GAPFCG, I-PAES, and Quark) that use different levels of earlier knowledge. (c) 2013 Wiley Periodicals, Inc.
引用
收藏
页码:1719 / 1734
页数:16
相关论文
共 117 条
[21]  
Capriles P., 2011, THESIS NATL LAB SCI
[22]  
Chen BH, 2010, ADAPT LEARN OPTIM, V3, P193
[23]  
Coello C, 2002, Evolutionary Algorithms for Solving Multi -objective Problems, DOI [10.1007/978-1-4757-5184-0, DOI 10.1007/978-1-4757-5184-0]
[24]   Evolutionary multi-objective optimization: A historical view of the field [J].
Coello Coello, Carlos A. .
IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 2006, 1 (01) :28-36
[25]   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
[26]  
Cui Y, 1998, PROTEINS, V31, P247, DOI 10.1002/(SICI)1097-0134(19980515)31:3<247::AID-PROT2>3.0.CO
[27]  
2-G
[28]  
Custodio F., 2010, IEEE C EV COMP CEC, P1
[29]  
Cutello V, 2005, LECT NOTES COMPUT SC, V3449, P54
[30]  
Cutello V., 2005, J R SOC INTERFACE, V83, P1