AUTHOR(S): Metodi Traykov, Nicola Yanev, Radoslav Mavrevski, Borislav Yurukov

TITLE Algorithm for Protein Folding Problem in 3D Lattice HP Model 
ABSTRACT The prediction of a protein’s tertiary structure from the amino acid sequence of a protein is known as the protein folding problem. The protein folding problem in 3D lattice HydrophobicPolar model is problem of finding the lowest energy conformation. This is the NPcomplete problem. In this article we propose extension of the heuristic algorithm described by some of authors to solve the protein folding problem in 3D cubic lattice in HP model. For computational experiments we use 8 HP sequences that are known in the literature benchmarks for 3D lattice in HP model. We compare the obtained results with results obtained by algorithms for solving the problem in 3D lattice HP model as genetic algorithms, antcolony optimization algorithm, and Monte Carlo algorithm. 
KEYWORDS Bioinformatics, Protein Folding Problem, 3D Cubic Lattice, HP Model, Heuristics, HP folding, 3D structure 
REFERENCES [1] K. Dill, Theory for the folding and stability of lobular proteins, BiochemistryUS, Vol. 24, 1985, pp. 15011509. 
Cite this paper Metodi Traykov, Nicola Yanev, Radoslav Mavrevski, Borislav Yurukov. (2018) Algorithm for Protein Folding Problem in 3D Lattice HP Model. International Journal of Biology and Biomedicine, 3, 1621 
