Protein Conformation of a Lattice Model Using Tabu Search

P. M. Pardalos, Xin Liu, G. L. Xue

Research output: Contribution to journalArticle

16 Scopus citations

Abstract

We apply tabu search techniques to the problem of determining the optimal configuration of a chain of protein sequences on a cubic lattice. The problem under study is difficult to solve because of the large number of possible conformations and enormous amount of computations required. Tabu search is an iterative heuristic procedure which has been shown to be a remarkably effective method for solving combinatorial optimization problems. In this paper, an algorithm is designed for the cubic lattice model using tabu search. The algorithm has been tested on a chain of 27 monomers. Computational results show that our method outperforms previously reported approaches for the same model.

Original languageEnglish (US)
Pages (from-to)55-68
Number of pages14
JournalJournal of Global Optimization
Volume11
Issue number1
DOIs
StatePublished - Jan 1 1997
Externally publishedYes

Keywords

  • Computational results
  • Global and combinatorial optimization
  • Lattice model
  • Protein conformation
  • Tabu search

ASJC Scopus subject areas

  • Computer Science Applications
  • Management Science and Operations Research
  • Control and Optimization
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Protein Conformation of a Lattice Model Using Tabu Search'. Together they form a unique fingerprint.

  • Cite this