Skip to main content
SpringerLink
Log in

Biological complexity: ant colony meta-heuristic optimization algorithm for protein folding

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

Ant colony meta-heuristic optimization (ACO) is one of the few algorithms that can help to gain an atomic level insight into the conformation of protein folding states, intermediate weights and pheromones present along the protein folding pathway. These are analysed by nodes (amino acids), and these nodes depend upon the probability of next optimized node (amino acids). Nodes have conformational degrees of freedom as well as depend upon the natural factors and collective behaviour of biologically important molecules like temperature, volume, pressure and other ensembles. This biological quantum complexity can be resolved using ACO algorithm. Ants are visually blind and important behaviour of communication among individuals or colony of ant environment is based on chemicals (pheromones) deposited by the ants. Just like ants, proteins are also a group of colony; amino acids are node (amino acid) attached to each others with the help of bonds. This paper is aimed to determine the factors affecting protein folding pattern using ant colony algorithm. Protein occurs structurally in a compact form and determining the ways of protein folding is called NP hard (non-deterministic polynomial-time hard) problem. Using the ACO, we have developed an algorithm for protein folding. It is interesting to note that based on ants ability to find new shorter path between the nest and the food, proteins can also be optimized for shorter path between one node to another node and the folding pattern can be predicted for an unknown protein (ab initio). We have developed an application based on ACO in Perl language (PFEBRT) for determining optimized folding path of proteins.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Dorigo M (2005) Ant colony optimization theory: a survey. Elsevier 344:243–278

    MathSciNet  MATH  Google Scholar 

  2. Kuwajima K (1989) The molten globule state as a clue for understanding the folding and cooperativity of globular-protein structure. Proteins Struct Funct Genet 6:87–103

    Article  Google Scholar 

  3. Dorigo M (1996) The ant system: optimization by a colony of cooperating agents. IEEE Trans 26:29–41

    Google Scholar 

  4. Dorigo M (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evolu Comput 1:53–66

    Article  Google Scholar 

  5. Dorigo M (1997) Ant colonies for the traveling salesman problem. Bio-Systems 43:73–81

    Article  Google Scholar 

  6. Dorigo M, Maniezzo V, Colorni A (1991) Positive feedback as a search strategy. Tech rep., pp 91–116

  7. Dorigo M, Di Caro G (1999) New ideas in optimization. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw-Hill, New York, pp 63–76

    Google Scholar 

  8. Bastolla U, Fravenkron H, Gestner E, Grassberger P, Nadler W (1998) Testing a New Monte Carlo algorithm for the protein folding problem. Proteins 32:52–66

    Article  Google Scholar 

  9. Georgopoulos C, Liberek K, Zylicz M, Ang D (1994) Heat-shock proteins in biology and medicine. Cold Spring Harbor Laboratory Press, Cold Spring Harbor, New York, pp 209–249

    Google Scholar 

  10. O’Toole EM, Panagiotopoulos AZ (1992) Monte Carlo simulation of folding transitions of simple model proteins using a chain growth algorithm. J Chem Phys 97:8644–8652

    Article  Google Scholar 

  11. Ramakrishnan R, Ramachandran B, Pekny JF (1997) A dynamic Monte Carlo algorithm for exploration of dense conformational spaces in heteropolymers. J Chem Phys 106:2418–2424

    Article  Google Scholar 

  12. Irback A (1998) Monte Carlo approach to biopolymers and protein folding. World Scientific, Singapore, pp 98–109

    Google Scholar 

  13. Sali A, Shakhnovich E, Karplus M (1994) How does a protein fold? Nature 369:248–251

    Article  Google Scholar 

  14. Kim PS, Baldwin RL (1990) Intermediates in the folding reactions of small proteins. Annu Rev Biochem 59:631–660

    Article  Google Scholar 

  15. Backofen R (2001) The protein structure prediction problem: a constraint optimization approach using a new lower bound. Springer 6:223–255

    MathSciNet  MATH  Google Scholar 

  16. Richards FM (1977) Areas, volumes, packing, and protein structures. Annu Rev Biophys Bioeng 6:151–176

    Article  Google Scholar 

  17. Chikenji G, Kikuchi M, Iba Y (1999) Multi-self-overlap ensemble for protein folding: ground state search and thermodynamics. ARXIV 27:1–4

    Google Scholar 

  18. Dill KA, Fiebig KM, Chan HS (1993) Cooperativity in protein-folding kinetics. Proc Natl Acad Sci USA 90:1942–1946

    Article  Google Scholar 

  19. Beutler T, Dill K (1996) A fast conformational search strategy for finding low energy structures of model proteins. Protein 5:2037–2043

    Article  Google Scholar 

  20. Yue K, Dill KA (1995) Forces of tertiary structural organization in globular proteins. Proc Natl Acad Sci USA 92:146–150

    Article  Google Scholar 

  21. Backofen R, Will S (2003) A constraint-based approach to structure prediction for simplified protein models that outperforms other existing methods. In: Proceedings of XIX international conference on logic programming, pp 49–71

  22. Torrie GM, Valleau JP (1977) Nonphysical sampling distributions in MC free energy estimation: umbrella sampling. J Comput Phys 23:187–199

    Article  Google Scholar 

  23. Berg BA, Neuhaus T (1992) Multicanonical ensemble: a new approach to simulate first-order phase transitions. Phys Rev Lett 68:9–12

    Article  Google Scholar 

  24. Plaxco KW, Simons KT, Baker D (1998) Contact order, transition state placement and the refolding rates of single domain proteins. J Mol Biol 277:985–994

    Article  Google Scholar 

  25. Hoos HH, Stützle T (2004) Stochastic local search: foundations and applications. Elsevier, Amsterdam, pp 1–156

    MATH  Google Scholar 

  26. Krasnogor N, Pelta D, Lopez PM, Mocciola P, de la Canal E (1998) Genetic algorithms for the protein folding problem: a critical view. In: Proceedings of engineering of intelligent systems. ICSC Academic Press, pp 353–360

  27. Patton AWP, Goldman E (1995) A standard GA approach to native protein conformation prediction. In: Proceedings of the 6th international conference in genetic algorithms Morgan Kaufmann Publishers, pp 574–581

  28. Unger R, Moult J (1993) Genetic algorithms for protein folding simulations. J Mol Biol 231:75–81

    Article  Google Scholar 

  29. Unger R, Moult J (1993) A genetic algorithm for three dimensional protein folding simulations. In: Proceedings of the 5th international conference on genetic algorithms Morgan Kaufmann Publishers, pp 581–588

  30. Hsu HP, Mehra V, Nadler W, Grassberger P (2003) Growth algorithm for lattice heteropolymers at low temperatures. J Chem Phys 51:118–444

    Google Scholar 

  31. Bin W, Zhongzhi S (2011) An ant colony algorithm based partition algorithm for TSP. Chin J Comput 24:1328–1333

    MathSciNet  Google Scholar 

  32. Gambardella LM, Dorigo M (1999) Ant colonies for the quadratic assignment problem. J Oper Res Soc 50:167–176

    Article  MATH  Google Scholar 

  33. Shmygelska A, Hernandez R, Hoos H H (2002): An ant colony optimization algorithm for the 2d hp protein folding problem. In: Proceedings of the 3rd international workshop on ant algorithms, pp 40–52

  34. Shmygelska A, Hoos HH (2005) An ant colony optimization algorithm for the 2d and 3d hydrophobic polar protein folding problem. BMC Bioinform 30:97–112

    Google Scholar 

  35. He LL, Shi F, Zhou HB (2011) Application of improved ant colony optimization algorithm to the 2D HP model. Wuhan Univ J (Nat Sci Edn) 51:33–38

    MathSciNet  Google Scholar 

  36. Xudong Wu (2012) A two-stage ant colony optimization algorithm for the vehicle routing problem with time windows. IJACT 4:485–491

    Google Scholar 

  37. Liu Fang (2012) A dual population parallel ant colony optimization algorithm for solving the travelling salesman problem. JCIT 7:66–74

    Google Scholar 

  38. Wang J, Wolf RM, Caldwell JW, Kollman PA, Case DA (2004) Development and testing of a general amber force field. J Comput Chem 25:1157–1174

    Article  Google Scholar 

  39. Singhal A, Ostermaier MK, Vishnivetskiy SA, Panneels V, Homan KT, Tesmer JJ, Veprintsev D, Deupi X, Gurevich VV, Schertler GF, Standfuss J (2013) Insights into congenital stationary night blindness based on the structure of G90D rhodopsin. EMBO Rep 14:520–526

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Biotechnology, Gautam Buddha University, Greater Noida, Uttar Pradesh, India

    Aman Chandra Kaushik & Shakti Sahi

Authors
  1. Aman Chandra Kaushik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shakti Sahi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shakti Sahi.

Electronic supplementary material

Below is the link to the electronic supplementary material.

Supplementary material 1 (DOCX 29 kb)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kaushik, A.C., Sahi, S. Biological complexity: ant colony meta-heuristic optimization algorithm for protein folding. Neural Comput & Applic 28, 3385–3391 (2017). https://doi.org/10.1007/s00521-016-2252-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-016-2252-5

Keywords

Search

Navigation