Protein Conformation of a Lattice Model Using Tabu Search

P. M. Pardalos, Xin Liu, Guoliang Xue

Research output: Contribution to journalArticle

16 Citations (Scopus)

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
StatePublished - 1997
Externally publishedYes

Fingerprint

Tabu search
Tabu Search
Lattice Model
Conformation
Conformations
Proteins
Protein
protein
heuristics
Combinatorial optimization
Protein Sequence
Combinatorial Optimization Problem
Computational Results
Monomers
Heuristics
Configuration
method
Lattice model
Model

Keywords

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

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Global and Planetary Change
  • Applied Mathematics
  • Control and Optimization

Cite this

Protein Conformation of a Lattice Model Using Tabu Search. / Pardalos, P. M.; Liu, Xin; Xue, Guoliang.

In: Journal of Global Optimization, Vol. 11, No. 1, 1997, p. 55-68.

Research output: Contribution to journalArticle

Pardalos, P. M. ; Liu, Xin ; Xue, Guoliang. / Protein Conformation of a Lattice Model Using Tabu Search. In: Journal of Global Optimization. 1997 ; Vol. 11, No. 1. pp. 55-68.
@article{f9e56b2ab63e4e55b992ed7ee26edffd,
title = "Protein Conformation of a Lattice Model Using Tabu Search",
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.",
keywords = "Computational results, Global and combinatorial optimization, Lattice model, Protein conformation, Tabu search",
author = "Pardalos, {P. M.} and Xin Liu and Guoliang Xue",
year = "1997",
language = "English (US)",
volume = "11",
pages = "55--68",
journal = "Journal of Global Optimization",
issn = "0925-5001",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - Protein Conformation of a Lattice Model Using Tabu Search

AU - Pardalos, P. M.

AU - Liu, Xin

AU - Xue, Guoliang

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

KW - Computational results

KW - Global and combinatorial optimization

KW - Lattice model

KW - Protein conformation

KW - Tabu search

UR - http://www.scopus.com/inward/record.url?scp=0346950252&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0346950252&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0346950252

VL - 11

SP - 55

EP - 68

JO - Journal of Global Optimization

JF - Journal of Global Optimization

SN - 0925-5001

IS - 1

ER -