Recursive domains in proteins

Teresa Przytycka, Rajgopal Srinivasan, George D Rose

Research output: Contribution to journalArticle

Abstract

The domain is a fundamental unit of protein structure. Numerous studies have analyzed folding patterns in protein domains of known structure to gain insight into the underlying protein folding process. Are such patterns a haphazard assortment or are they similar to sentences in a language, which can be generated by an underlying grammar? Specifically, can a small number of intuitively sensible rules generate a large class of folds, including feasible new folds? In this paper, we explore the extent to which four simple rules can generate the known all-β folds, using tools from graph theory. As a control, an exhaustive set of β-sandwiches was tested and found to be largely incompatible with such a grammar. The existence of a protein grammar has potential implications for both the mechanism of folding and the evolution of domains.

Original languageEnglish (US)
Pages (from-to)409-417
Number of pages9
JournalProtein Science
Volume11
Issue number2
DOIs
StatePublished - 2002

Fingerprint

Protein Folding
Protein folding
Proteins
Language
Graph theory
Protein Domains

Keywords

  • Folding rules
  • Hierarchy
  • Protein domains
  • Protein evolution
  • Protein folding
  • Protein topology

ASJC Scopus subject areas

  • Biochemistry

Cite this

Recursive domains in proteins. / Przytycka, Teresa; Srinivasan, Rajgopal; Rose, George D.

In: Protein Science, Vol. 11, No. 2, 2002, p. 409-417.

Research output: Contribution to journalArticle

Przytycka, T, Srinivasan, R & Rose, GD 2002, 'Recursive domains in proteins', Protein Science, vol. 11, no. 2, pp. 409-417. https://doi.org/10.1110/ps.24701
Przytycka, Teresa ; Srinivasan, Rajgopal ; Rose, George D. / Recursive domains in proteins. In: Protein Science. 2002 ; Vol. 11, No. 2. pp. 409-417.
@article{ba81cee444a9498698036b4f4a8d1988,
title = "Recursive domains in proteins",
abstract = "The domain is a fundamental unit of protein structure. Numerous studies have analyzed folding patterns in protein domains of known structure to gain insight into the underlying protein folding process. Are such patterns a haphazard assortment or are they similar to sentences in a language, which can be generated by an underlying grammar? Specifically, can a small number of intuitively sensible rules generate a large class of folds, including feasible new folds? In this paper, we explore the extent to which four simple rules can generate the known all-β folds, using tools from graph theory. As a control, an exhaustive set of β-sandwiches was tested and found to be largely incompatible with such a grammar. The existence of a protein grammar has potential implications for both the mechanism of folding and the evolution of domains.",
keywords = "Folding rules, Hierarchy, Protein domains, Protein evolution, Protein folding, Protein topology",
author = "Teresa Przytycka and Rajgopal Srinivasan and Rose, {George D}",
year = "2002",
doi = "10.1110/ps.24701",
language = "English (US)",
volume = "11",
pages = "409--417",
journal = "Protein Science",
issn = "0961-8368",
publisher = "Cold Spring Harbor Laboratory Press",
number = "2",

}

TY - JOUR

T1 - Recursive domains in proteins

AU - Przytycka, Teresa

AU - Srinivasan, Rajgopal

AU - Rose, George D

PY - 2002

Y1 - 2002

N2 - The domain is a fundamental unit of protein structure. Numerous studies have analyzed folding patterns in protein domains of known structure to gain insight into the underlying protein folding process. Are such patterns a haphazard assortment or are they similar to sentences in a language, which can be generated by an underlying grammar? Specifically, can a small number of intuitively sensible rules generate a large class of folds, including feasible new folds? In this paper, we explore the extent to which four simple rules can generate the known all-β folds, using tools from graph theory. As a control, an exhaustive set of β-sandwiches was tested and found to be largely incompatible with such a grammar. The existence of a protein grammar has potential implications for both the mechanism of folding and the evolution of domains.

AB - The domain is a fundamental unit of protein structure. Numerous studies have analyzed folding patterns in protein domains of known structure to gain insight into the underlying protein folding process. Are such patterns a haphazard assortment or are they similar to sentences in a language, which can be generated by an underlying grammar? Specifically, can a small number of intuitively sensible rules generate a large class of folds, including feasible new folds? In this paper, we explore the extent to which four simple rules can generate the known all-β folds, using tools from graph theory. As a control, an exhaustive set of β-sandwiches was tested and found to be largely incompatible with such a grammar. The existence of a protein grammar has potential implications for both the mechanism of folding and the evolution of domains.

KW - Folding rules

KW - Hierarchy

KW - Protein domains

KW - Protein evolution

KW - Protein folding

KW - Protein topology

UR - http://www.scopus.com/inward/record.url?scp=0036149462&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036149462&partnerID=8YFLogxK

U2 - 10.1110/ps.24701

DO - 10.1110/ps.24701

M3 - Article

C2 - 11790851

AN - SCOPUS:0036149462

VL - 11

SP - 409

EP - 417

JO - Protein Science

JF - Protein Science

SN - 0961-8368

IS - 2

ER -