Abstract
Predicting protein secondary structures using lattice models is one of the most studied computational problems in bioinformatics. Here the secondary structure or three dimensional structure of a protein is predicted from its amino acid sequence. The secondary structure refers to local sub-structures of a protein. Mostly founded secondary structures are alpha helix and beta sheets. Simplified energy models have been proposed in the literature on the basis of interaction of amino acid residues in proteins. Here we use well researched Hydrophobic-Polar (HP) energy model. In this paper, we propose the hexagonal prism lattice with diagonals that can overcome the problems of other lattice structures, e.g., parity problem. We give two approximation algorithms for protein folding on this lattice. Our first algorithm leads us to a similar structure of helix structure that is commonly found in a protein structure. This motivates us to propose the next algorithm with a better approximation ratio.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
M.S. Rahman—Supported by a ACU Titular Fellowship.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Agarwala, R., Batzogloa, S., Dancik, V., Decatur, S., Hannenhalli, S., Farach, M., Muthukrishnan, S., Skiena, S.: Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model. J. Comput. Biol. 4(3), 276–296 (1997)
Berger, B., Leighton, T.: Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete. J. Comput. Biol. 5(1), 27–40 (1998)
Böckenhauer, H.-J., Bongartz, D.: Protein folding in the hp model on grid lattices with diagonals. Discrete Appl. Math. 155(2), 230–256 (2007)
Böckenhauer, H.-J., Dayem Ullah, A.Z.M., Kapsokalivas, L., Steinhöfel, K.: A local move set for protein folding in triangular lattice models. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS, vol. 5251, pp. 369–381. Springer, Heidelberg (2008)
Crescenzi, P., Goldman, D., Papadimitriou, C.H., Piccolboni, A., Yannakakis, M.: On the complexity of protein folding. J. Comput. Biol. 5(3), 423–465 (1998)
Dill, K.A.: Theory for the folding and stability of globular proteins. Biochemistry 24, 1501–1509 (1985)
Hart, W., Istrail, S.: Fast protein folding in the hydrophobic-hydrophilic model within three-eighths of optimal. J. Comput. Biol. 3(1), 53–96 (1996)
Hart, W., Istrail, S.: Lattice and o-lattice side chain models of protein folding: linear time structure prediction better than 86 % of optimal. Comput. Biol. 4(3), 241–259 (1997)
Heun, V.: Approximate protein folding in the HP side chain model on extended cubic lattices (extended abstract). In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 212–223. Springer, Heidelberg (1999)
Hoque, M.T., Chetty, M., Dooley, L.S.: A hybrid genetic algorithm for 2D FCC hydrophobic-hydrophilic lattice model to predict protein folding. In: Sattar, A., Kang, B.-H. (eds.) AI 2006. LNCS, vol. 4304, pp. 867–876. Springer, Heidelberg (2006)
Hoque, M.T., Chetty, M., Sattar, A.: Protein folding prediction in 3D FCC HP lattice model using genetic algorithm. In: IEEE Congress on Evolutionary Computation, pp. 4138–4145 (2007)
Islam, A.S.M.S., Rahman, M.S.: On the protein folding problem in 2D-triangular lattices. Algorithms Mol. Biol. 8, 30 (2013)
Islam, A.S.M.S., Rahman, M.S.: Protein folding in 2D-triangular lattice revisited. In: Lecroq, T., Mouchard, L. (eds.) IWOCA 2013. LNCS, vol. 8288, pp. 244–257. Springer, Heidelberg (2013)
Jiang, M., Zhu, B.: Protein folding on the hexagonal lattice in the HP model. J. Bioinform. Comput. Biol. 3(1), 19–34 (2005)
Kessler, I., Livingston, M.: The expected number of parts in a partition of n. Monatshefte für Mathematik 81(3), 203–212 (1976)
Mauri, G., Piccolboni, A., Pavesi, G.: Approximation algorithms for protein folding prediction. In: Symposium on Discrete Algorithms (SODA), pp. 945–946 (1999)
Newman, A.: A new algorithm for protein folding in the HP model. In: Symposium on Discrete Algorithms (SODA), pp. 876–884 (2002)
Newman, A., Ruhl, M.: Combinatorial problems on strings with applications to protein folding. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 369–378. Springer, Heidelberg (2004)
Shaw, D.L., Islam, A.S.M.S., Rahman, M.S., Hasan, M.: Protein folding in HP model on hexagonal lattices with diagonals. BMC Bioinform. 15(S–2), S7 (2014)
Unger, R., Moult, J.: Genetic algorithms for protein folding simulations. J. Mol. Biol. 231, 75–81 (1993)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Shaw, D.L., Islam, A.S.M.S., Karmaker, S., Rahman, M.S. (2016). Approximation Algorithms for Three Dimensional Protein Folding. In: Kaykobad, M., Petreschi, R. (eds) WALCOM: Algorithms and Computation. WALCOM 2016. Lecture Notes in Computer Science(), vol 9627. Springer, Cham. https://doi.org/10.1007/978-3-319-30139-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-30139-6_22
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30138-9
Online ISBN: 978-3-319-30139-6
eBook Packages: Computer ScienceComputer Science (R0)