Volume 80, Issue 2 pp. 463-470
Research Article

Super folds, networks, and barriers

Sean Burke

Sean Burke

Institute for Computational Engineering and Sciences, University of Texas at Austin, Austin, Texas 78712

Search for more papers by this author
Ron Elber

Corresponding Author

Ron Elber

Institute for Computational Engineering and Sciences, University of Texas at Austin, Austin, Texas 78712

Department of Chemistry and Biochemistry, University of Texas at Austin, Austin, Texas 78712

Institute of Computational Engineering and Sciences, 1 University Station C0200, Austin, Texas 78712-0027===Search for more papers by this author
First published: 01 October 2011
Citations: 10

Abstract

Exhaustive enumeration of sequences and folds is conducted for a simple lattice model of conformations, sequences, and energies. Examination of all foldable sequences and their nearest connected neighbors (sequences that differ by no more than a point mutation) illustrates the following: (i) There exist unusually large number of sequences that fold into a few structures (super-folds). The same observation was made experimentally and computationally using stochastic sampling and exhaustive enumeration of related models. (ii) There exist only a few large networks of connected sequences that are not restricted to one fold. These networks cover a significant fraction of fold spaces (super-networks). (iii) There exist barriers in sequence space that prevent foldable sequences of the same structure to “connect” through a series of single point mutations (super-barrier), even in the presence of the sequence connection between folds. While there is ample experimental evidence for the existence of super-folds, evidence for a super-network is just starting to emerge. The prediction of a sequence barrier is an intriguing characteristic of sequence space, suggesting that the overall sequence space may be disconnected. The implications and limitations of these observations for evolution of protein structures are discussed. Proteins 2012. © 2011 Wiley Periodicals, Inc.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.