Statistical Properties of Contact Maps

Abstract

A contact map is a simple representation of the structure of proteins and other chain-like macromolecules. This representation is quite amenable to numerical studies of folding. We show that the number of contact maps corresponding to the possible configurations of a polypeptide chain of N amino acids, represented by (N-1)-step self avoiding walks on a lattice, grows exponentially with N for all dimensions D>1. We carry out exact enumerations in D=2 on the square and triangular lattices for walks of up to 20 steps and investigate various statistical properties of contact maps corresponding to such walks. We also study the exact statistics of contact maps generated by walks on a ladder.

Latex file, 15 pages, 12 eps figures. To appear on Phys. Rev. E

References in corpus (1)

• Thermodynamic stability of folded proteins against mutations

Cited by in corpus (11)

• Protein folding using contact maps
• Reconstruction of protein structures from a vectorial representation
• A unified model for Sierpinski networks with scale-free scaling and small-world effect
• Statistical properties of contact vectors
• Folding Kinetics of a Polymer
• A scale-free network hidden in the collapsing polymer
• Protein Ground State Candidates in a Simple Model: An Exact Enumeration
• Pseudoknots in a Homopolymer
• The Origin of the Designability of Protein Structures
• Information Loss in Coarse Graining of Polymer Configurations via Contact Matrices
• Zigzag Stacks and m-Regular Linear Stacks