Skip to main content

An Improved Tabu Search Algorithm for 3D Protein Folding Problem

  • Conference paper
PRICAI 2008: Trends in Artificial Intelligence (PRICAI 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5351))

Included in the following conference series:

Abstract

An improved Tabu Search (TS) algorithm is presented for three- dimensional (3D) protein folding structure prediction in off-lattice protein AB model. Tabu Search algorithm is one of global optimization algorithms which has strong local search and has been applied for many combination optimization problems. The experimental results show that the ground-state energies obtained by our algorithm are better than those by previous methods. Moreover, the improved Tabu search algorithm has higher searching performance and can be effectively used to predict 3D protein folding structure.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anfinsen, C.B.: Principles that govern the folding of protein chains. Science 181, 223–227 (1973)

    Article  Google Scholar 

  2. Zhang, X., LinHHH, X., Wan, C., LiHHH, T.: Genetic-annealing algorithm for 3D off-lattice protein folding model. In: PAKDD Workshops 2007, pp. 186–193 (2007)

    Google Scholar 

  3. Kim, S.-Y., Lee, S.B., Lee, J.: Structure optimization by conformational space annealing in an off-lattice protein model. Phys. Rev. E 72, 011916 (2005)

    Article  Google Scholar 

  4. Chen, M., Huang, W.: Simulated annealing algorithm for protein folding problem. Mini-Micro Systems 28(1), 75–78 (2007) (in Chinese)

    MathSciNet  Google Scholar 

  5. Stillinger, F.H., Head-Gordon, T., Hirshfel, C.L.: Toy model for protein folding. Phys. Rev. E 48, 1469–1477 (1993)

    Article  Google Scholar 

  6. Glover, F.: Tabu search: Part I. ORSA. Journal on Computing 1, 190–206 (1989)

    Article  MATH  Google Scholar 

  7. Glover, F.: Tabu search: part II. ORSA. Journal on Computing 2, 4–329 (1990)

    Article  MATH  Google Scholar 

  8. Glover, F.: Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 13, 533–549 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hsu, H.-P., Mehra, V., Grassberger, P.: Structure optimization in an off-lattice protein model. Phys. Rev. E 68, 037703 (2003)

    Article  Google Scholar 

  10. Bachmann, M., Arkin, H., Janke, W.: Multi-canonical study of coarse grained off-lattice models for folding heteropolymers. Phys.Rev. E 71, 031906 (2005)

    Article  MathSciNet  Google Scholar 

  11. Mount, D.W.: Bioinformatics: sequence and genome analysis. Cold Spring Harbor Laboratory Press (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, X., Cheng, W. (2008). An Improved Tabu Search Algorithm for 3D Protein Folding Problem. In: Ho, TB., Zhou, ZH. (eds) PRICAI 2008: Trends in Artificial Intelligence. PRICAI 2008. Lecture Notes in Computer Science(), vol 5351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89197-0_114

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89197-0_114

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89196-3

  • Online ISBN: 978-3-540-89197-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics