Parallel Ant Colony Optimization for 3D Protein Structure Prediction using the HP Lattice Model

  • Daniel Chu
  • Albert Zomaya
Part of the Studies in Computational Intelligence book series (SCI, volume 22)


Protein structure prediction (also known as the protein folding problem) studies the way in which a protein will ‘fold’ into its natural state. Due to the enormous complexities involed in accuratly predicting protein structures, many simplifications have been proposed. The Hydrophobic-Hydrophilic (HP) method is one such method of simplifying the problem. In this chapter we introduce a novel method of solving the HP protein folding problem in both two and three dimensions using Ant Colony Optimizations and a distributed programming paradigm. Tests across a small number of processors indicate that the multiple colony distributed ACO (MACO) approach outperforms single colony implementations. Experimental results also demonstrate that the proposed algorithms perform well in terms of network scalability.


Candidate Solution Protein Structure Prediction High Quality Solution Local Search Phase Pheromone Matrix 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Klaus M. Fiebig A. Dill and Hue Sun Chan. Cooperativity in protein folding kinetics. Proceedings of the National Academy of Sciences, 90:1942–1946, 1993.CrossRefGoogle Scholar
  2. 2.
    W. Punch A. Patton and E. Goodman. A standard GA approach to native protein conformation prediction. Proc Incl Conf on Genetic Algorithms, pages 574–581, 1995.Google Scholar
  3. 3.
    M. Guntsch M. Middendorf O. Diessel H. ElGindy H. Schmeck B. Scheuermann, K.So. Applied Soft Computing 4, pages 303–322, 2004.Google Scholar
  4. 4.
    Bonnie Berger and Tom Leighton. Protein folding in the hydrophobic – hydrophilic (HP) model is np-complete. Journal of Computational Biology, 5(1):27–40, 1998.CrossRefGoogle Scholar
  5. 5.
    R. F. Hartl Bullnheimer D and C Strauss. Ant Colony Optimization in Vehicle Routing. PhD thesis, University of Vienna, 1999.Google Scholar
  6. 6.
    Costa D. and A. Hertz. Ants can Colour Graphs. Journal of Operational Research Society, 48:295–305, 1997.zbMATHCrossRefGoogle Scholar
  7. 7.
    K.A. Dill. Biochemistry 1985.Google Scholar
  8. 8.
    J. Flores, S.D. Smith. The 2003 Congress on Evoluntionary Computation, 4:2338–2345, 2003.Google Scholar
  9. 9.
    Dorigo M.L.M Gambardella. Ant Colonies for the Travelling Salesman Problem. BioSystems, 43:73–81, 1997.CrossRefGoogle Scholar
  10. 10.
    E. Taillard Gambardella L.M and M. Dorigo. Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society, 50:167–176, 1999.zbMATHCrossRefGoogle Scholar
  11. 11.
    T.Z. Jiang. Protein folding simulations of the hydrophobic-hydrophilic model by combining tabu search with genetic algorithms. The Journal of Chemical Physics 119(8):4592, Aug 2003.CrossRefGoogle Scholar
  12. 12.
    M. Khimasia and P. Coveney. Protein structure prediction as a hard optimization problem: the genetic algorithm approach. Molecular Simulation, 19:205–226, 1997.Google Scholar
  13. 13.
    K.F. Lau and K.A. Dill. A lattice statistical mechanics model of the conformation and sequence space for proteins. Macromolecules, 22, 1989.Google Scholar
  14. 14.
    Faming Liang and Wing Hung Wong. Evolutionary mote carlo for protein folding simulations. The Journal of Chemical Physics, 115(7):3374–3380, August 2001.CrossRefGoogle Scholar
  15. 15.
    Dorigo M. Optimization, Learning and Natural Algorithms. PhD thesis, Politicnico di Milano, 1992.Google Scholar
  16. 16.
    Gambardella L.M and M. Dorigo. Has-sop: An hybrid ant system for the sequential ordering problem. Technical Report IDSIA 97–11, Lugano, Switzerland, 1997Google Scholar
  17. 17.
    H. Schmek M.Middendorf, F. Reischle. Information exchange in multi colony ant algorithms. Parallel and Distributed Computing: Proceedings in the Fifteenth IPDPS Workshops 2000, 2000Google Scholar
  18. 18.
    F.M Richards. Areas, volumes, packing and protein structures. Annu. Rev. Biophys. Bioeng., 6:151–176, 1977.CrossRefGoogle Scholar
  19. 19.
    A Shmygelska and H.H. Hoos. An improved ant colony optimization algorithm for the 2d HP protein folding problem. Canadian Conference on AI 2003, pages 400–417, 2003.Google Scholar
  20. 20.
    W. Hart, S. Istrail. HP Benchmarks last accessed October 2004Google Scholar
  21. 21.
    Branden. C, Tooze. J, Introduction to Protein Structure. Garland Publ, New York, London.Google Scholar
  22. 22.
    Michael Shirts Stefan M. Larson, Christopher D. Snow and Vijay S.Pande. Using distributed computing to tackle previously intractable problems in computational biology. 2002.Google Scholar
  23. 23.
    L.TOMO and A.TOMA. Contact interactions method: A new algorithm for protein folding simulations. Protein Science, 5(1):147–153, 1996.CrossRefGoogle Scholar
  24. 24.
    Ron Unger and John Moult. A genetic algorithm for 3d protein folding simulations. Proceedings of the Fifth Annual International Conference on Genetic Algorithms, pages 581–588, 1993.Google Scholar

Copyright information

© Springer 2006

Authors and Affiliations

  • Daniel Chu
    • 1
  • Albert Zomaya
    • 1
  1. 1.School of IT, Faculty of ScienceUniversity of SydneyAustralia

Personalised recommendations