In this article, a protein sequence of length n is embedded in a two-dimensional lattice with m (>n) points. Thus the obtained minimal energy configurations are expected to have flexible shapes in contrast to the compact rectangular conformations. To fulfill this extension, the elastic net algorithm is modified to deal with the difficulty brought by the unsymmetrical relationship between amino acids and lattice points. New set partition strategy in the embedding phase is introduced, and two local search methods are applied to overcome the multimapping phenomena. Several HP benchmark examples with up to 48 amino acids are tested to verify the effectiveness of the proposed approach.
Get full access to this article
View all access options for this article.
References
1.
AlenaS., RosaliaA.H., and HolgerH.H.2005. An ant colony optimization algorithm for the 2D HP protein folding problem. Ant Algor. 2463, 40–53.
2.
BallK.D., ErmanB., and DillK.A.2002. The elastic net algorithm and protein structure prediction. J. Comp. Chem. 23, 77–83.
3.
CustódioF.L., BarbosaH.J.C., and DardenneL.E.2004. Investigation of the three-dimensional lattice HP protein folding model using a genetic algorithm. Genet. Mol. Biol., 27, 611–615.
4.
DillK.A., BrombergS., YueK., et al.1995. Principles of protein folding—a perspective from simple exact models. Protein Sci. 4, 561–602.
5.
DurbinR., and WillshawD.1987. An analogue approach to the travelling salesman problem using an elastic net method. Nature. 326, 689–691.
6.
GuoY.Z., FengE.M., ZhaoJ.C., et al.2007. Optimal HP configurations of protein by combining local search with elastic net algorithm. J. Biochem. Biophys. Method, 70, 335–340.
7.
HopfieldJ.J., and TankD.W.1985. Neural computation of decisions in optimization problems. Biol. Cybernet. 52, 141–152.
8.
JiangT.Z., CuiQ.H., ShiG.H., et al.2003. Protein folding simulations of the hydrophilic model by combining tabu search with genetic algorithms. J. Chem. Phys. 119, 4592–4596.
9.
LauK.F., and DillK.A.1998. A lattice statistical mechonics model of the conformation and sequence space of proteins. Macromolecules. 22, 3986–3997.
10.
LiangF.M., and WongW.H.2001. Evolutionary Monte Carlo for protein folding simulations. J. Chem. Phys. 115, 3374–3380.
11.
MakovetsS., and BlackburnE.H.2009. DNA damage signalling prevents deleterious telomere addition at DNA breaks. Nat. Cell. Biol., 11, 1383–1386.
12.
MillerD.W., and DillK.A.1997. Ligand binding to proteins: the binding landscape model. Protein Sci. 6, 2166–2179.
13.
SailA., ShakhnovichE.I., and KarplusM.1994. How does a protein fold?. Neture, 369, 248–251.
14.
SimicP.D.1991. Constrained nets for graph matching and other quadratic assigment problem. Neural Comp. 3, 268–281.
15.
UngerR., and MoultJ.1993. Genetic algorithms for protein folding simulations. J. Mol. Biol. 231, 75–81.
YanikogluB., and ErmanB.2002. Minimum energy configuration of the 2-dimensional HP-model of proteins by self-organizing networks. J. Comp. Biol. 9, 613–620.
18.
ZhangX.S., WangY., ZhanZ.W., et al.2005. Exploring protein's optimal HP congfigurations by self-organizing. J. Bioinform. Comput. Biol. 3, 385–400.
