Abstract
The hydrophobic-hydrophilic (H-P) model for protein folding was introduced by Dill et al.[7]. A problem instance consists of a sequence of amino acids, each labeled as either hydrophobic (H) or hydrophilic (P). The sequence must be placed on a 2D or 3D grid without overlapping, so that adjacent amino acids in the sequence remain adjacent in the grid. The goal is to minimize the energy, which in the simplest variation corresponds to maximizing the number of adjacent hydrophobic pairs. The protein folding problem in the H-P model is NP-hard in both 2D and 3D. Recently, Fu and Wang [10] proved an exp(O(n 1 − − 1/d)ln n) algorithm for d-dimensional protein folding simulation in the HP-model. Our preliminary results on stochastic search applied to protein folding utilize complete move sets proposed by Lesh et al.[15] and Blazewicz et al.[4]. We obtain that after (m/δ)O( Γ) Markov chain transitions, the probability to be in a minimum energy conformation is at least 1–δ, where m is the maximum neighbourhood size and Γ is the maximum value of the minimum escape height from local minima of the underlying energy landscape. We note that the time bound depends on the specific instance. Based on [10] we conjecture Γ≤n 1 − − 1/d. We analyse \(\Gamma \leq \sqrt{n}\) experimentally on selected benchmark problems [15,21] for the 2D case.
Research partially supported by EPSRC Grant No. EP/D062012/1.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Albrecht, A.A.: A stopping criterion for logarithmic simulated annealing. Computing (in press, 2006)
Anfinsen, C.B.: Principles that govern the folding of protein chains. Science 181, 223–230 (1973)
Berger, B., Leighton, T.: Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete. J. Comput. Biol. 5, 27–40 (1998)
Blazewicz, J., Lukasiak, P., Milostan, M.: Application of tabu search strategy for finding low energy structure of protein. Artif. Intell. Med. 35, 135–145 (2005)
Catoni, O.: Rough large deviation estimates for simulated annealing: applications to exponential schedules. Ann. Probab. 20, 1109–1146 (1992)
Černy, V.: A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. J. Optim. Theory Appl. 45, 41–51 (1985)
Dill, K.A., Bromberg, S., Yue, K., Fiebig, K.M., Yee, D.P., Thomas, P.D., Chan, H.S.: Principles of protein folding – A perspective from simple exact models. Protein Sci. 4, 561–602 (1995)
Eastwood, M.P., Hardin, C., Luthey-Schulten, Z., Wolynes, P.G.: Evaluating protein structure-prediction schemes using energy landscape theory. IBM J. Res. Dev. 45, 475–497 (2001)
Finkelstein, A.V., Badretdinov, A.Y.: Rate of protein folding near the point of thermodynamic equilibrium between the coil and the most stable chain fold. Folding & Design 2, 115–121 (1997)
Fu, B., Wang, W.: A \(2^{O(n^{1-1/d}\cdot \log{n})}\) time algorithm for d-dimensional protein folding in the HP-model. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 630–644. Springer, Heidelberg (2004)
Greenberg, H.J., Hart, W.E., Lancia, G.: Opportunities for combinatorial optimization in computational biology. INFORMS J. Comput. 16, 211–231 (2004)
Hajek, B.: Cooling schedules for optimal annealing. Mathem. Oper. Res. 13, 311–329 (1988)
Heun, V.: Approximate protein folding in the HP side chain model on extended cubic lattices. Discrete Appl. Math. 127, 163–177 (2003)
Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Lesh, N., Mitzenmacher, M., Whitesides, S.: A complete and effective move set for simplified protein folding. In: Proc. RECOMB 2003, pp. 188–195 (2003)
Nayak, A., Sinclair, A., Zwick, U.: Spatial codes and the hardness of string folding problems. J. Comput. Biol. 6, 13–36 (1999)
Neumaier, A.: Molecular modeling of proteins and mathematical prediction of protein structure. SIAM Rev. 39, 407–460 (1997)
Ngo, J.M., Marks, J., Karplus, M.: Computational complexity, protein structure prediction, and the Levinthal paradox. In: Merz Jr., K., LeGrand, S. (eds.) The Protein Folding Problem and Tertiary Structure Prediction, pp. 433–506. Birkhäuser, Boston (1994)
Pardalos, P.M., Liu, X., Xue, G.: Protein conformation of a lattice model using tabu search. J. Global Optim. 11, 55–68 (1997)
Straub, J.E.: Protein folding and optimization algorithms. In: The Encyclopedia of Computational Chemistry, vol. 3, pp. 2184–2191. Wiley & Sons, Chichester (1998)
Unger, R., Moult, J.: Genetic algorithms for protein folding simulations. J. Mol. Biol. 231, 75–81 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Steinhöfel, K., Skaliotis, A., Albrecht, A.A. (2006). Landscape Analysis for Protein-Folding Simulation in the H-P Model. In: Bücher, P., Moret, B.M.E. (eds) Algorithms in Bioinformatics. WABI 2006. Lecture Notes in Computer Science(), vol 4175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11851561_24
Download citation
DOI: https://doi.org/10.1007/11851561_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39583-6
Online ISBN: 978-3-540-39584-3
eBook Packages: Computer ScienceComputer Science (R0)