A Particle Swarm Optimization-Based Approach with Local Search for Predicting Protein Folding

被引:7
作者
Yang, Cheng-Hong [1 ]
Lin, Yu-Shiun [1 ]
Chuang, Li-Yeh [2 ]
Chang, Hsueh-Wei [3 ,4 ,5 ]
机构
[1] Natl Kaohsiung Univ Appl Sci, Dept Elect Engn, Kaohsiung, Taiwan
[2] I Shou Univ, Inst Biotechnol & Chem Engn, Dept Chem Engn, 1,Sec 1,Syuecheng Rd, Kaohsiung 840, Taiwan
[3] Natl Sun Yat Sen Univ, Inst Med Sci & Technol, Kaohsiung, Taiwan
[4] Kaohsiung Med Univ Hosp, Dept Med Res, Kaohsiung, Taiwan
[5] Kaohsiung Med Univ, Dept Biomed Sci & Environm Biol, Kaohsiung, Taiwan
关键词
particle swarm optimization; global search; local search; protein folding; hydrophobic-polar (HP) model; ALGORITHM; STABILITY; LATTICE;
D O I
10.1089/cmb.2016.0104
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
The hydrophobic-polar (HP) model is commonly used for predicting protein folding structures and hydrophobic interactions. This study developed a particle swarm optimization (PSO)-based algorithm combined with local search algorithms; specifically, the high exploration PSO (HEPSO) algorithm (which can execute global search processes) was combined with three local search algorithms (hill-climbing algorithm, greedy algorithm, and Tabu table), yielding the proposed HE-L-PSO algorithm. By using 20 known protein structures, we evaluated the performance of the HE-L-PSO algorithm in predicting protein folding in the HP model. The proposed HE-L-PSO algorithm exhibited favorable performance in predicting both short and long amino acid sequences with high reproducibility and stability, compared with seven reported algorithms. The HE-L-PSO algorithm yielded optimal solutions for all predicted protein folding structures. All HE-L-PSO-predicted protein folding structures possessed a hydrophobic core that is similar to normal protein folding.
引用
收藏
页码:981 / 994
页数:14
相关论文
共 28 条
[1]   PRINCIPLES THAT GOVERN FOLDING OF PROTEIN CHAINS [J].
ANFINSEN, CB .
SCIENCE, 1973, 181 (4096) :223-230
[2]   On the Characterization and Software Implementation of General Protein Lattice Models [J].
Bechini, Alessio .
PLOS ONE, 2013, 8 (03)
[3]  
Chen Mao, 2005, Genomics Proteomics & Bioinformatics, V3, P225
[4]   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
[5]  
Deronne Kevin W, 2007, J Bioinform Comput Biol, V5, P335, DOI 10.1142/S0219720007002618
[6]   Some remarks on greedy algorithms [J].
DeVore, RA ;
Temlyakov, VN .
ADVANCES IN COMPUTATIONAL MATHEMATICS, 1996, 5 (2-3) :173-187
[7]   THEORY FOR THE FOLDING AND STABILITY OF GLOBULAR-PROTEINS [J].
DILL, KA .
BIOCHEMISTRY, 1985, 24 (06) :1501-1509
[8]  
Glover F., 1990, ORSA Journal on Computing, V2, P4, DOI [10.1287/ijoc.1.3.190, 10.1287/ijoc.2.1.4]
[9]  
Gromiha MM, 2011, CURR PROTEIN PEPT SC, V12, P490
[10]  
Hoque MT, 2006, LECT NOTES COMPUT SC, V4304, P867