Folding minimal sequences: The lower bound for sequence complexity of globular proteins

69Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Alphabet size and informational entropy, two formal measures of sequence complexity, are herein applied to two prior studies on the folding of minimal proteins. These measures show a designed four-helix bundle to be unlike its natural counterparts but rather more like a coiled-coil dimer. Segments from a simplified sarc homology 3 domain and more than 2 000 000 segments from globular proteins both have lower bounds for alphabet size of 10 and for entropy near 2.9. These values are therefore suggested to be necessary and sufficient for folding into globular proteins having both rigid side chain packing and biological function. Copyright (C) 1999 Federation of European Biochemical Societies.

Cite

CITATION STYLE

APA

Romero, P., Obradovic, Z., & Dunker, A. K. (1999). Folding minimal sequences: The lower bound for sequence complexity of globular proteins. FEBS Letters, 462(3), 363–367. https://doi.org/10.1016/S0014-5793(99)01557-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free