Ab initio protein fold prediction using evolutionary algorithms:: Influence of design and control parameters on performance

被引:18
作者
Djurdjevic, Dusan P. [1 ]
Biggs, Mark J. [1 ]
机构
[1] Univ Edinburgh, Inst Mat & Proc, Edinburgh EH9 3JL, Midlothian, Scotland
关键词
protein fold; protein tertiary structure; genetic algorithm (GA); stochastic optimization; polyalanine; met-enkephalin; biosensors; biomaterials; interfaces;
D O I
10.1002/jcc.20440
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
True ab initio prediction of protein 3D structure requires only the protein primary structure, a physicochemical free energy model, and a search method for identifying the free energy global minimum. Various characteristics of evolutionary algorithms (EAs) mean they are in principle well suited to the latter. Studies to date have been less than encouraging, however. This is because of the limited consideration given to EA design and control parameter issues. A comprehensive study of these issues was, therefore, undertaken for ab initio protein fold prediction using a full atomistic protein model. The performance and optimal control parameter settings of twelve EA designs where first established using a 15-residue polyalanine molecule-design aspects varied include the encoding alphabet, crossover operator, and replacement strategy. It can be concluded that real encoding and multipoint crossover are superior, while both generational and steady-state replacement strategies have merits. The scaling between the optimal control parameter settings and polyalanine size was also identified for both generational and steady-state designs based on real encoding and multipoint crossover. Application of the steady-state design to met-enkephalin indicated that these scalings are potentially transferable to real proteins. Comparison of the performance of the steady state design for met-enkephalin with other ab initio methods indicates that EAs can be competitive provided the correct design and control parameter values are used. (c) 2006 Wiley Periodicals, Inc.
引用
收藏
页码:1177 / 1195
页数:19
相关论文
共 149 条
[1]   A genetic algorithm for shortest path routing problem and the sizing of populations [J].
Ahn, CW ;
Ramakrishna, RS .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (06) :566-579
[2]   Prediction of oligopeptide conformations via deterministic global optimization [J].
Androulakis, IP ;
Maranas, CD ;
Floudas, CA .
JOURNAL OF GLOBAL OPTIMIZATION, 1997, 11 (01) :1-34
[3]  
[Anonymous], 1988, P 1988 ROCKY MOUNTAI
[4]  
[Anonymous], FDN GENETIC ALGORITH
[5]  
[Anonymous], FDN GENETIC ALGORITH
[6]  
[Anonymous], 1988, P 5 INT C MACHINE LE
[7]  
[Anonymous], 1991, 4th International Conference on Genetic Algorithms
[8]  
[Anonymous], 1991, Handbook of genetic algorithms
[9]  
ANTONISSE J, 1989, PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P86
[10]  
ARGOS P, 1994, PROTEIN STRUCTURE BY DISTANCE ANALYSIS, P315