Computational investigations of folded self-avoiding walks related to protein folding

Various subsets of self-avoiding walks naturally appear when investigating existing methods designed to predict the 3D conformation of a protein of interest. Two such subsets, namely the folded and the unfoldable self-avoiding walks, are studied computationally in this article. We show that these two sets are equal and correspond to the whole n-step self-avoiding walks for n≤14, but that they are different for numerous n≥108, which are common protein lengths. Concrete counterexamples are provided and the computational methods used to discover them are completely detailed. A tool for studying these subsets of walks related to both pivot moves and protein conformations is finally presented.

[1]  Aric Hagberg,et al.  Exploring Network Structure, Dynamics, and Function using NetworkX , 2008, Proceedings of the Python in Science Conference.

[2]  Paul J. Flory,et al.  The Configuration of Real Polymer Chains , 1949 .

[3]  Axel Bacher,et al.  Weakly directed self-avoiding walks , 2011, J. Comb. Theory, Ser. A.

[4]  Rolf Backofen,et al.  Algorithmic approach to quantifying the hydrophobic force contribution in protein folding , 1999, German Conference on Bioinformatics.

[5]  P. G. de Gennes,et al.  Exponents for the excluded volume problem as derived by the Wilson method , 1972 .

[6]  R. Durrett.  Random walks and random environments. Volume 1: Random walks , 1996 .

[7]  Jacques M. Bahi,et al.  Protein Folding in the 2D Hydrophobic–Hydrophilic (HP) Square Lattice Model is Chaotic , 2011, Cognitive Computation.

[8]  Gordon Slade,et al.  The self-avoiding walk: A brief survey , 2011 .

[9]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[11]  P. M. Lee,et al.  Random Walks and Random Environments: Volume 1: Random Walks , 1995 .

[12]  Jacques M. Bahi,et al.  Chaos of protein folding , 2011, The 2011 International Joint Conference on Neural Networks.

[13]  A R Conway,et al.  Algebraic techniques for enumerating self-avoiding walks on the square lattice , 1993 .

[14]  Philippe Flajolet,et al.  Some New Self-avoiding Walk and Polygon Models , 2012, Fundam. Informaticae.

[15]  N. Madras,et al.  THE SELF-AVOIDING WALK , 2006 .

[16]  A. Sokal,et al.  The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk , 1988 .

[17]  Jacques M. Bahi,et al.  Is protein Folding Problem Really a NP-Complete One? First Investigations , 2013, J. Bioinform. Comput. Biol..

[18]  Abdul Sattar,et al.  Genetic Algorithm inAb Initio Protein Structure Prediction Using Low Resolution Model: A Review , 2009, Biomedical Data and Applications.