Healthc Inform Res Search


Healthc Inform Res > Volume 19(2); 2013 > Article
Venkatesan, Gopal, Candavelou, Gollapalli, and Karthikeyan: Computational Approach for Protein Structure Prediction



To predict the structure of protein, which dictates the function it performs, a newly designed algorithm is developed which blends the concept of self-organization and the genetic algorithm.


Among many other approaches, genetic algorithm is found to be a promising cooperative computational method to solve protein structure prediction in a reasonable time. To automate the right choice of parameter values the influence of self-organization is adopted to design a new genetic operator to optimize the process of prediction. Torsion angles, the local structural parameters which define the backbone of protein are considered to encode the chromosome that enhances the quality of the confirmation. Newly designed self-configured genetic operators are used to develop self-organizing genetic algorithm to facilitate the accurate structure prediction.


Peptides are used to gauge the validity of the proposed algorithm. As a result, the structure predicted shows clear improvements in the root mean square deviation on overlapping the native indicates the overall performance of the algorithm. In addition, the Ramachandran plot results implies that the conformations of phi-psi angles in the predicted structure are better as compared to native and also free from steric hindrances.


The proposed algorithm is promising which contributes to the prediction of a native-like structure by eliminating the time constraint and effort demand. In addition, the energy of the predicted structure is minimized to a greater extent, which proves the stability of protein.

I. Introduction

Resolving the functional conformation of a protein remains a central challenge in molecular biology [1]. Structural knowledge is imperative to analyze the functionality of protein; such knowledge contributes much to the development of better drug design, higher-yield crops, and even synthetic bio-fuels. Predicting the three-dimensional (3D) structure of a protein is one of the greatest challenge and a cornerstone for structural biologists.
Currently, there are three experimental techniques, namely, X-ray crystallography, nuclear magnetic resonance (NMR) spectroscopy, and electron microscopy, that can be used to determine the 3D structure of protein with accuracy. Due to technical difficulties, the gap between the number of known sequences and the predicted structure is widening, which is a formidable challenge in terms of effort demand and time consumption. Thus, there is a greater need than ever before for a reliable computational method to address the problem of protein structure prediction (PSP) directly from the sequence.
The existing computational methods are categorized into three approaches based on the information used to model the protein. Homology modeling and threading utilize the structural information of similar proteins, whereas the ab initio method does not. The template free approach is followed by ab initio and it has been proven to be better in several cases.
Many successive computational studies have proposed solution for the conformation structure of protein, such as the evolutionary algorithm [2,3], Monte Carlo [4,5], and HP models [6,7]; however, such solutions are not powerful to search structures in a huge conformational space. The genetic algorithm (GA) has been chosen and has proven to be a reliable computational tool to address the PSP problem because of 1) its success in solving a complex problem by improving the speed using parallelization and 2) the computation process involved in the genetic search to find the optimal strategies for a large space.
Even though several studies have explored the implementation of GA variants [1,8-17] on PSP, the efficiency of GA can be realized only by setting appropriate parameter values. As various inputs require different parameter settings, they are usually obtained by ad-hoc experimentation with manual tuning by a trial-and-error method. This is time consuming and requires a lot of experience and knowledge. On the other hand, inappropriate selection of values leads to premature convergence and consequently, failure to find the optimum in a reasonable computational time, especially when the size of the conformational space is huge (PSP).
From the research work [18] using GA, it is clear that the confirmation results produced were not satisfactory. To overcome the previously mentioned limitations, the most important parameter values of genetic operators need to be self-organized. Therefore, this study focuses on the application of a novel genetic algorithm called the self-organizing genetic algorithm for PSP (SOGA-PSP), which self-configures the crossover and mutation rate during execution, thereby reducing the complexity, which in turn increases the performance efficiency.
Since Met-enkephalin (Protein Data Bank [PDB] ID: 1PLW) has been a test case in many studies [16,19,20], the developed algorithm was tested using the same protein. In addition, the NNFGAIL segment from islet amyloid polypeptide (PDB ID: 3DGJ) was also tested.

II. Methods

1. Genetic Algorithm

Algorithm begins with initial population
  1. Fitness function f(x) is calculated for every chromosome x in the population.

  2. Reiterate the following procedure to regenerate the population;

    • Choose the parents on the basis of fitness score

    • Reproduce the offspring by crossover operator

    • Mutate the resultant chromosome

    • Calculate the fitness score for elite selection

    • Resultant chromosome reproduces the population

  3. Algorithm terminates as it reaches the fitness value/number of generations.

2. Self-Organizing Genetic Algorithm

A self-organizing system operates based on information received locally without the guidance of the external environment. It is an adaptive methodology adopted for GA to discover the interaction of operators to collect the required information to set the parameter values in an automated way. The SOGA was developed with full knowledge of the test problem and parameter values which are incremented uniformly in each generation. Self-organization contributes desirable factors to GA by adding knowledge to guide and assist the choice of right parameter values.

3. Self-Organizing Genetic Algorithm to Protein Structure Prediction

Generally, knowledge regarding the interaction of parameters leads to better global solutions in less time, thereby making GA more robust. A lack of robustness in the choice of design parameters always leads to search imbalance, causing premature convergence and lower performance, which is completely eliminated by the developed algorithm given below:
  • Step 1: Generate n chromosomes for the initial population

  • Step 2: Encode the structure for n chromosomes using TINKER [18]

  • Step 3: Calculate the energy value for each chromosome using Discovery Studio [21]

  • Step 4: Select and save the elite (chromosome with minimal energy value)

  • Step 5: Initialize the crossover and mutation rate

  • Step 6: Repeat the following steps to create a new population

    • Calculate the crossover point for initial crossover

    • Select the elite and replace, if it is low

    • Increase crossover rate with uniform interval

    • Perform mutation with initial mutation rate

    • Select the elite and replace if it is low

    • Increase mutation rate by uniform interval

  • Step 7: Algorithm terminates by reaching the optimal rate SOGA-PSP is pictorially represented in Figure 1.

4. Chromosome Representation

The chromosome representation varies for different problems, and as a set, it constitutes an individual structure called a gene, a set of solution representatives. In general, Cartesian coordinates, templates, torsion angles, side chains, and simplified residues are considered for chromosome representation in PSP [8]. In the present work, torsion [22] and side chain angles [23] were assumed to be best for encoding the chromosomes since both contribute much to the consistency and confirmation of protein structure.

5. Number of Generations

Self-organizing mutation and crossover rates are uniformly increased until they reach the optimal values; in turn the termination condition decides the number of generations.

6. Population Initialization

Population is created using frequently occurring torsion angles [15] which have the degree of freedom for adequate adaptability of GA; it helps in determining the 3D conformation, which is chosen for population size.

7. Fitness Evaluation

The population created in each generation is evaluated by fitness function for selection of the elite [24]. It projects the nature of each chromosome, and the energy value that determines the elite is calculated using the CHARMM force field chosen as the objective function:
Etot = Ebs + Eab + EUB + Eid + Eta + EVdW + Ecc
  • Etot: Total energy (fitness)

  • Ebs: Energy of stretching bond

  • Eab: Energy of bending angle

  • EUB: Energy of Urey-Bradley

  • Eit: Energy of improper dihedrals

  • Eta: Energy of torsion angle

  • EVdW: Energy of van der Waals

  • Ecc: Energy of charge-charge [18]

8. Selection

The selection operator elitism, selects the best chromosome with minimal energy as elite. In each generation the elite may be replaced by the low-energy chromosome for genetic operations.

9. Self-Organizing Crossover Operator (SOCO)

To refine the search space, the crossover operator which is normally fixed in standard genetic algorithm (SGA) is self-organized. The least optimal rate is initially chosen for execution without termination at the convergence point, and it is increased uniformly until it reaches the optimal upper limit [25], or the rates are modified from high to low [26]. The reported range of the rate (0.70 to 0.85) is considered for self-organization.
The working principle of SOCO
  • Select crossover point with the initial rate

  • Perform single-point crossover operation

  • Genes from two parents within the crossover point are interchanged to reproduce children

  • Model the protein structure using TINKER [27]

  • Calculate the energy value to select the elite

  • Repeat the process with uniform interval

The crossover operation is pictorially represented in Figure 2.

10. Self-Organizing Mutation Operator (SOMO)

The purpose of mutation is to transform the chromosome to change the conformation and to prevent the population from stagnating at any local optimum. With a fixed mutation rate, the search space is compressed, which leads to premature convergence, and it may not be possible to predict the optimal solution. Self-organization is used to avoid this, and the mutation rate is self-configured. Only the constrained values are considered for the test problem since slight changes may occur in the sequential order of amino acids, which in turn may change the entire structure [17].
The working principle of the SOMO operator is:
  • Select mutation point with initial rate

  • Mutate the gene value

  • Model the protein structure using TINKER

  • Calculate the energy value to select the elite

  • Repeat the process with uniform interval

The mutation operation is pictorially represented in Figure 3.

III. Results

The efficiency of the developed algorithm is implemented on a biological problem, PSP, using two peptides as test case for Met-enkephalin and NNFGAIL.

1. Met-enkephalin

Met-enkephalin (PDB ID: 1PLW) was chosen because it plays a crucial role in generating tissue damage signals as initiated by both peripheral and central nervous system (CNS). Also, it is a simple pentamer used as a test case to measure the efficiency of various ab initio methods. Unlike natural crossover and mutation observed in real cellular chromosomes, randomness is restricted in SGA, where it is designed to propagate in a defined architecture due to fixed values. This limitation is relaxed by defining the rate range so that better results can be produced by switching between the intervals. The rate ranges of 0.75-0.85 and 0.025-0.075 were adopted for crossover and mutation to execute the developed SOGA, whereas the rates are 0.85 and 0.075 in SGA. Accordingly, three generations were produced using predefined rates as shown in Tables 1 and 2. With the inherent limitations of SGA in choosing a crossover rate, peptide conformations are generated, and a huge deviation of energy is observed as seen in the plot. However, in the SOGA approach, predicted conformations are maintained in a standard low-energy distribution as shown in Figures 4 and 5. The best values scored by the protein structure indicate that it provides much better confirmation against a native-structure using NMR. Also similar backbone confirmation is indicated by a root mean square deviation (RMSD) value of 0.0009. Eventually, differences in side chain orientations are also clearly seen; this improves the backbone dihedral angles, which is very clear from Ramachandran plot shown in Table 3 and Figure 6 [28]. On closer view, differences in the orientation of side chains (Y1, F3, and M5) of the predicted and native structures clearly indicate better side chain selection. The overall results confirm the performance efficiency of SOGA-PSP to predict refined peptide structures free from steric hindrances.

2. NNFGAIL Segment from Islet Amyloid Polypeptide (3DGJ)

NNFGAIL is a fragment of human islet amyloid polypeptide (IAPP or amylin) of 37-residue hormone found in pancreatic extracts of type 2 diabetics. It plays a role in the function of the pancreas and contributes to glycemic control [29]. The structure of the peptide was predicted using SOGA; as a result, the energy of the structure was comparatively minimal which indicates better conformation as shown in Table 4 and Figure 7. On superimposing with the native structure, an RMSD value of 0.939 was obtained and 5 hydrogen bonds were formed, a most important factor for structure stability. Furthermore, as an advantage out of two hydrogen bonds of X-ray structure, one is conserved. This conservation is also seen in the Ramachandran plot (Table 5 and Figure 8).On further examination, the differences in the orientation of the side chains of the predicted and native structures indicate that better side chain selection is achieved with the proposed approach.

IV. Discussion

It is well known that the prediction of protein structures through wet lab or experimental methods is very expensive and time consuming. Hence, the challenge was taken up in this study to develop a novel algorithm, SOGA implemented on PSP. The proposed algorithm was proved to be better, and the result obtained demonstrated that it outperforms the approaches taken in previous work [18]. It also avoids the previously mentioned drawbacks of other approaches, which proves the relative efficiency of the algorithm. Furthermore, energy is minimized to a greater extent, and the RMSD value reflects a similar backbone conformation against native structures. The strength of this research also lies in considering only torsion angles as input. In general, the best mechanism adopted for PSP contributes much to the modeling of loops, which are the most common and functionally important substructures. Using current methods like homology modeling or database search, the loops are modeled with less accuracy. As SOGA-PSP has been shown to be a better method to predict the structure of proteins, and it can also be extended to loop modeling.


Dr. V. Amouda acknowledges the receipt of financial support from University Grants Commission (UGC), Government of India, and Centre for Bioinformatics, Pondicherry University, India. The authors are grateful to Mr. M. Sundara Mohan and Mr. P. Manivel, Centre for Bioinformatics, Pondicherry University for their constant support all through the work.


No potential conflict of interest relevant to this article was reported.


1. Pedersen JT, Moult J. Genetic algorithms for protein structure prediction. Curr Opin Struct Biol 1996;6(2):227-231. PMID: 8728656.
2. de Lima TW, Gabriel PH, Delbem AC, Faccioli RA, da Silva IN. Evolutionary algorithm to ab initio protein structure prediction with hydrophobic interactions Proceedings of the IEEE Congress on Evolutionary Computation; 2007 Sep 25-28. Singapore; p. 612-619.

3. Piccolboni A, Mauri G. Application of evolutionary algorithm to protein folding prediction. In: Hao JK, Lutton E, Ronald E, Schoenauer M, Snyers D, editors. Artificial Evolution. Heidelberg, Germany: Springer; 1998. p. 123-135.

4. Carnevali P, Toth G, Toubassi G, Meshkat SN. Fast protein structure prediction using monte carlo simulations with modal moves. J Am Chem Soc 2003;125(47):14244-14245. PMID: 14624550.
5. Lee B, Kurochkina N, Kang HS. Protein folding by a biased Monte Carlo procedure in the dihedral angle space. FASEB J 1996;10(1):119-125. PMID: 8566532.
6. Mandal S, Jana ND. Protein structure prediction using 2D HP lattice model based on integer programming approach Proceedings of 2012 International Congress on Informatics, Environment, Energy and Applications; 2012 Mar 17-18. Singapore; p. 171-175.

7. Benitez CM, Lopes HS. Protein structure prediction with the 3D-HP side-chain model using a master-slave parallel genetic algorithm. J Braz Comput Soc 2010;16(1):69-78.
8. Cui Y, Chen RS, Wong WH. Protein folding simulation with genetic algorithm and supersecondary structure constraints. Proteins 1998;31(3):247-257. PMID: 9593196.
9. Zhang X, Wang T, Luo H, Yang JY, Deng Y, Tang J, et al. 3D protein structure prediction with genetic tabu search algorithm. BMC Syst Biol 2010;4(Suppl 1):S6PMID: 20522256.
10. Hoque MT, Chetty M, Sattar A. Genetic algorithm in ab initio protein structure prediction using low resolution model: a review. In: Sidhu AS, Dillon TS, editors. Biomedical data and applications. Heidelberg, Germany: Springer; 2009. p. 317-342.

11. Dandekar T, Argos P. Applying experimental data to protein fold prediction with the genetic algorithm. Protein Eng 1997;10(8):877-893. PMID: 9415438.
12. Contreras-Moreira B, Fitzjohn PW, Offman M, Smith GR, Bates PA. Novel use of a genetic algorithm for protein structure prediction: searching template and sequence alignment space. Proteins 2003;53(Suppl 6):424-429. PMID: 14579331.
13. Goldberg DE. Genetic algorithms in search, optimization and machine learning. Reading (MA): Addison-Wesley Publishing Co.; 1989.

14. Kaiser CE, Merkle LD, Lamont GB, Gates GH Jr, Pachter R. Case studies in protein structure prediction with real-valued genetic algorithms Proceedings of the 8th SIAM Conference on Parallel Processing for Scientific Computing; 1997 Mar 14-17. Minneapolis, MN.

15. Day RO, Zydallis JB, Lamont GB, Pachter R. Solving the protein structure prediction problem through a multiobjective genetic algorithm Proceeding of the International Conference on Computational Nanoscience and Nanotechnology; 2002 Apr 21-25. San Juan, Puerto Rico; p. 32-35.

16. Deerman KR, Lamont GB, Pachter R. Linkage-learning genetic algorithm application to the protein structure prediction problem Proceedings of the ACM Symposium on Applied Computing; 2001 Mar 11-14. Las Vegas, NV; p. 333-339.

17. Schulze-Kremer S, Tiedemann U. Parameterizing genetic algorithms for protein folding simulation Proceedings of the 27th Hawaii International Conference on System Sciences; 1994 Jan 4-7. Wailea, HI; p. 345-354.

18. Tragante-do-O V, Tinos R. A self-organizing genetic algorithm for protein structure prediction. Learn Nonlinear Model 2010;8(3):135-147.
19. Fogel GB, Corne DW. Evolutionary computation in bioinformatics. Boston (MA): Morgan Kaufmann Publishers; 2003.

20. Klepeis JL, Pieja MJ, Floudas CA. Hybrid global optimization algorithms for protein structure prediction: alternating hybrids. Biophys J 2003;84(2 Pt 1):869-882. PMID: 12547770.
21. Accelrys Software Inc. Discovery Studio modeling environment, release 3.1. San Diego (CA): Accelrys Software Inc.; 2012.

22. Srinivasan R. Phi, psi distribution of amino-acids from 42 proteins [Internet]. Baltimore (MD): RoseLab, Johns Hopkins University; cited 2013 May 1. Available from:

23. Tuffery P, Etchebest C, Hazout S, Lavery R. A new approach to the rapid determination of protein side chain conformations. J Biomol Struct Dyn 1991;8(6):1267-1289. PMID: 1892586.
24. Thierens D. Adaptive mutation rate control schemes in genetic algorithms Proceedings of the 2002 Congress on Evolutionary Computation; 2002 May 12-17. Honolulu, HI; p. 980-985.

25. Bao-Juan H, Jian Z, De-Hong Y. A novel and accelerated genetic algorithm. WSEAS Trans Syst Control 2008;3(4):269-278.

26. Breukelaar R, Back T. Self-adaptive mutation rates in genetic algorithm for inverse design of cellular automata Proceedings of the 10th Annual Conference on Generic and Evolutionary Computation; 2008 Jul 12-16. Atlanta, GA; p. 1101-1102.

27. Jay Ponder Lab. TINKER: software tools for molecular design (TINKER 3.9, June 2001) [Internet]. St. Louis (MO): Washington University; c2013. cited 2013 May 1. Available from:

28. Rampage. Cambridge: Department of Biochemistry, University of Cambridge; cited 2013 May 1. Available from:

29. Wiltzius JJ, Sievers SA, Sawaya MR, Cascio D, Popov D, Riekel C, et al. Atomic structure of the cross-β spine of islet amyloid polypeptide (amylin). Protein Sci 2008;17(9):1467-1474. PMID: 18556473.
Figure 1
Flowchart for self-organizing genetic algorithm for protein structure prediction.
Figure 2
Self-organizing crossover operation.
Figure 3
Self-organizing mutation operation.
Figure 4
(A) 1PLW - graphical schema of energy variations of crossover in standard genetic algorithm (SGA). (B) Graphical schema of energy variations of mutation in SGA.
Figure 5
(A) 1PLW - graphical schema of energy variations in crossover of self-organizing genetic algorithm (SOGA). (B) Graphical schema of energy variations in mutation of SOGA.
Figure 6
(A) Native structure and its Ramachandran plot of 1 PLW, (B) Predicted structure and its Ramachandran plot. (C) Differences between the native and predicted structures on superimposition.
Figure 7
(A) 3DGJ - graphical schema of energy variations in crossover of self-organizing genetic algorithm (SOGA). (B) Graphical schema of energy variations in mutation of SOGA.
Figure 8
(A) Native structure and Ramachandran plot of 3DGJ. (B) Predicted structure and its Ramachandran plot. (C) Differences between the native and predicted structures on superimposition.
Table 1
1PLW - elite selection with minimal energy value for SGA

1PLW: Met-enkephalin, SGA: standard genetic algorithm.

Table 2
1PLW - elite selection with minimal energy value for SOGA (highlighted)

1PLW: Met-enkephalin, SOGA: self-organizing genetic algorithm.

Table 3
Ramachandran plot of predicted and native structures of 1PLW

1PLW: Met-enkephalin.

Table 4
3DGJ - elite selection with minimal energy value for SOGA (highlighted)

3DGJ: islet amyloid polypeptide, SOGA: self-organizing genetic algorithm.

Table 5
Ramachandran plot of predicted and native structures of 3DGJ

3DGJ: islet amyloid polyptptide.


Browse all articles >

Editorial Office
1618 Kyungheegung Achim Bldg 3, 34, Sajik-ro 8-gil, Jongno-gu, Seoul 03174, Korea
Tel: +82-2-733-7637, +82-2-734-7637    E-mail:                

Copyright © 2021 by Korean Society of Medical Informatics. All rights reserved.

Developed in M2community

Close layer
prev next