Folding minimal sequences: the lower bound for sequence complexity of globular proteins
- 30 November 1999
- journal article
- Published by Wiley in FEBS Letters
- Vol. 462 (3) , 363-367
- https://doi.org/10.1016/s0014-5793(99)01557-4
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.Keywords
This publication has 18 references indexed in Scilit:
- Intrinsically unstructured proteins: re-assessing the protein structure-function paradigmJournal of Molecular Biology, 1999
- How representative are the known structures of the proteins in a complete genome? A comprehensive structural censusFolding and Design, 1998
- Simplified proteins: minimalist solutions to the ‘protein folding problem’Current Opinion in Structural Biology, 1998
- NACP, A Protein Implicated in Alzheimer's Disease and Learning, Is Natively UnfoldedBiochemistry, 1996
- Non-globular domains in protein sequences: Automated segmentation using complexity measuresComputers & Chemistry, 1994
- Sequences with ‘unusual’ amino acid compositionsCurrent Opinion in Structural Biology, 1994
- One thousand families for the molecular biologistNature, 1992
- De Novo Design, Expression, and Characterization of Felix: a Four-Helix Bundle Protein of Native-Like SequenceScience, 1990
- Protein Design, a Minimalist ApproachScience, 1989
- The packing of α-helices: simple coiled-coilsActa Crystallographica, 1953