Protein folding in HP model on hexagonal lattices with diagonals

Three dimensional structure prediction of a protein from its amino acid sequence, known as protein folding, is one of the most studied computational problem in bioinformatics and computational biology. Since, this is a hard problem, a number of simplified models have been proposed in literature to capture the essential properties of this problem. In this paper we introduce the hexagonal lattices with diagonals to handle the protein folding problem considering the well researched HP model. We give two approximation algorithms for protein folding on this lattice. Our first algorithm is a 53-approximation algorithm, which is based on the strategy of partitioning the entire protein sequence into two pieces. Our next algorithm is also based on partitioning approaches and improves upon the first algorithm.

[1]  R Unger,et al.  Genetic algorithms for protein folding simulations. , 1992, Journal of molecular biology.

[2]  I. Kessler,et al.  The expected number of parts in a partition ofn , 1976 .

[3]  Hans-Joachim Böckenhauer,et al.  Protein folding in the HP model on grid lattices with diagonals , 2007, Discret. Appl. Math..

[4]  A. Hanks.  Canada , 2002 .

[5]  Alantha Newman,et al.  Combinatorial Problems on Strings with Applications to Protein Folding , 2004, LATIN.

[6]  Alejandro López-Ortiz,et al.  Efficient view point selection for silhouettes of convex polyhedra , 2011, Comput. Geom..

[7]  Alejandro López-Ortiz,et al.  Searching for the center of a circle , 2002, CCCG.

[8]  Mohammad Sohel Rahman,et al.  On the protein folding problem in 2D-triangular lattices , 2013, Algorithms for Molecular Biology.

[9]  Virginia Richardson,et al.  Searching for a Center , 2000 .

[10]  Steven Skiena,et al.  Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model , 1997, RECOMB '97.

[11]  Sue Whitesides,et al.  A complete and effective move set for simplified protein folding , 2003, RECOMB '03.

[12]  Hans-Joachim Böckenhauer,et al.  A Local Move Set for Protein Folding in Triangular Lattice Models , 2008, WABI.

[13]  Alejandro López-Ortiz,et al.  Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections , 2007, FSTTCS.

[14]  Masud Hasan,et al.  Vindictive Voronoi Games and Stabbing Delaunay Circles , 2010, 2010 International Symposium on Voronoi Diagrams in Science and Engineering.

[15]  Mihalis Yannakakis,et al.  On the Complexity of Protein Folding , 1998, J. Comput. Biol..

[16]  Binhai Zhu,et al.  Protein Folding on the Hexagonal Lattice in the Hp Model , 2005, J. Bioinform. Comput. Biol..

[17]  Abdul Sattar,et al.  Protein folding prediction in 3D FCC HP lattice model using genetic algorithm , 2007, 2007 IEEE Congress on Evolutionary Computation.

[18]  Madhu Chetty,et al.  A Hybrid Genetic Algorithm for 2D FCC Hydrophobic-Hydrophilic Lattice Model to Predict Protein Folding , 2006, Australian Conference on Artificial Intelligence.

[19]  K. Dill.  Theory for the folding and stability of globular proteins. , 1985, Biochemistry.

[20]  William E. Hart,et al.  Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal , 1995, STOC '95.

[21]  Md. Saidur Rahman,et al.  A linear algorithm for compact box‐drawings of trees , 2003, Networks.

[22]  Alantha Newman.  A new algorithm for protein folding in the HP model , 2002, SODA '02.

[23]  Volker Heun,et al.  Approximate protein folding in the HP side chain model on extended cubic lattices , 1999, Discret. Appl. Math..

[24]  Yong Duan,et al.  Computational protein folding: From lattice to all-atom , 2001, IBM Syst. J..