Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Annals of Operations Research - Special issue on Tabu search
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
IRREGULAR '95 Proceedings of the Second International Workshop on Parallel Algorithms for Irregularly Structured Problems
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Equivalent formulations and necessary optimality conditions for the Lennard–Jones problem
Journal of Global Optimization
Multiple sequence alignment using tabu search
APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
Stochastic protein folding simulation in the three-dimensional HP-model
Computational Biology and Chemistry
Application of tabu search strategy for finding low energy structure of protein
Artificial Intelligence in Medicine
Stochastic protein folding simulation in the d-dimensional HP-model
BIRD'07 Proceedings of the 1st international conference on Bioinformatics research and development
Landscape analysis for protein-folding simulation in the h-p model
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Protein structure optimization by side-chain positioning via beta-complex
Journal of Global Optimization
Hi-index | 0.00 |
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.