Protein folding prediction in the HP model using ions motion optimization with a greedy algorithm

Table 3 Comparison of algorithms studied here for optimal solutions

Sequence^*1	SGA	HGA	TS	ERS-GA	HHGA	IMOG
1	−11	−15	−15	−15	− 15	−15
2	−10	−13	−17	− 13	− 17	−17
3	− 10	− 10	− 12	−12	− 12	−12
4	− 16	−19	− 24	− 20	− 23	− 24
5	−26	−32	− 40	− 32	− 41	−40
6	−21	−23	NA	−30	−38	−40
7	−40	− 46	− 70	− 55	− 66	− 67
8	− 33	−46	−50	− 47	− 63	− 69

^*1Sequences from Table 1. Bold numbers indicate the best solution for the same test sequence
NA: not available; SGA: simple genetic algorithm; HGA: Hybrid Genetic Algorithm [22]; TS: tabu search [23]; ERS-GA: elite-based reproduction strategy-genetic algorithm [9]; HHGA: hybrid of hill climbing and genetic algorithm [9]; IMOG: Ions motion optimization with a greedy algorithm

ISSN: 1756-0381