An improved tabu search algorithm for 3D protein folding problem

11Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Zhang, X., & Cheng, W. (2008). An improved tabu search algorithm for 3D protein folding problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5351 LNAI, pp. 1104–1109). https://doi.org/10.1007/978-3-540-89197-0_114

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free