Exact enumeration of three-dimensional lattice proteins

We present an algorithm for the exhaustive enumeration of all monomer sequences and conformations of short lattice proteins as described by the hydrophobic-polar (HP) model. The algorithm is used for an exact identification of all designing sequences of HP proteins consisting of up to 19 monomers whose conformations are represented by interacting self-avoiding walks on the simple cubic lattice. Employing a parallelized implementation on a Linux cluster, we generate the complete set of contact maps of such walks.

[1]  P. Grassberger.  Pruned-enriched Rosenbluth method: Simulations of θ polymers of chain length up to 1 000 000 , 1997 .

[2]  Peter S. Pacheco.  Parallel programming with MPI , 1996 .

[3]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[4]  D. Thouless.  Introduction to Phase Transitions and Critical Phenomena , 1972 .

[5]  Anthony J. Guttmann,et al.  Self-avoiding walks on the simple cubic lattice , 2000 .

[6]  Universal amplitude combinations for self-avoiding walks, polygons and trails , 1993, cond-mat/9303035.

[7]  Erich Bornberg-Bauer,et al.  Chain growth algorithms for HP-type lattice proteins , 1997, RECOMB '97.

[8]  K. Binder.  Monte Carlo and molecular dynamics simulations in polymer science , 1995 .

[9]  N. Wingreen,et al.  Emergence of Preferred Structures in a Simple Model of Protein Folding , 1996, Science.

[10]  Wolfhard Janke,et al.  Thermodynamics of lattice heteropolymers. , 2003, The Journal of chemical physics.

[11]  Chao Tang,et al.  Simple models of the protein folding problem , 1999, cond-mat/9912450.

[12]  James Philbin,et al.  Fast tree search for enumeration of a lattice model of protein folding , 2001, The Journal of Chemical Physics.

[13]  K. Lin,et al.  Universal amplitude ratios for three-dimensional self-avoiding walks , 2002 .

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

[15]  A Mitsutake,et al.  Generalized-ensemble algorithms for molecular simulations of biopolymers. , 2000, Biopolymers.

[16]  D. Eisenberg.  Proteins. Structures and molecular properties, T.E. Creighton. W. H. Freeman and Company, New York (1984), 515, $36.95 , 1985 .

[17]  A. Sokal.  Monte Carlo methods for the self-avoiding walk , 1994, hep-lat/9509032.

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

[19]  Naeem Jan,et al.  Self-avoiding walks in two to five dimensions: exact enumerations and series study , 1992 .

[20]  R. Jernigan,et al.  Residue-residue potentials with a favorable contact pair term and an unfavorable high packing density term, for simulation and threading. , 1996, Journal of molecular biology.

[21]  K. Dill,et al.  A lattice statistical mechanics model of the conformational and sequence spaces of proteins , 1989 .

[22]  H. Stanley,et al.  Introduction to Phase Transitions and Critical Phenomena , 1972 .

[23]  Carl Troein,et al.  Enumerating Designing Sequences in the HP Model , 2002, Journal of biological physics.

[24]  Wolfhard Janke,et al.  Multicanonical chain-growth algorithm. , 2003, Physical review letters.