Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

 
 
DownloadE-Mail
  Prediction of viable circular permutants using a graph theoretic approach

Paszkiewicz, K. H., Sternberg, M. J. E., & Lappe, M. (2006). Prediction of viable circular permutants using a graph theoretic approach. Bioinformatics, 22(1), 1353-1358. doi:10.1093/bioinformatics/btl095.

Item is

Dateien

einblenden: Dateien
ausblenden: Dateien
:
1353.pdf (beliebiger Volltext), 369KB
 
Datei-Permalink:
-
Name:
1353.pdf
Beschreibung:
-
OA-Status:
Sichtbarkeit:
Eingeschränkt (Max Planck Institute for Molecular Genetics, MBMG; )
MIME-Typ / Prüfsumme:
application/pdf
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
eDoc_access: INSTITUT
Lizenz:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Paszkiewicz, Konrad H., Autor
Sternberg, Michael J. E., Autor
Lappe, Michael1, Autor           
Affiliations:
1Independent Junior Research Groups (OWL), Max Planck Institute for Molecular Genetics, Max Planck Society, ou_1433554              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: Motivation: In recent years graph-theoretic descriptions have been applied to aid the analysis of a number of complex biological systems. However, such an approach has only just begun to be applied to examine protein structures and the network of interactions between residues with promising results. Here we examine whether a graph measure known as closeness is capable of predicting regions where a protein can be split to form a viable circular permutant. Circular permutants are a powerful experimental tool to probe folding mechanisms and more recently have been used to design split enzyme reporter proteins. Results: We test our method on an extensive set of experiments carried out on dihydrofolate reductase in which circular permutants were constructed for every amino acid position in the sequence, together with partial data from studies on other proteins. Results show that closeness is capable of correctly identifying significantly more residues which are suitable for circular permutation than solvent accessibility. This has potential implications for the design of successful split enzymes having particular importance for the development of protein–protein interaction screening methods and offers new perspectives on protein folding. More generally, the method illustrates the success with which graph-theoretic measures encapsulate the variety of long and short range interactions between residues during the folding process.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2006-03-16
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 305754
DOI: 10.1093/bioinformatics/btl095
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Bioinformatics
Genre der Quelle: Zeitschrift
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 22 (1) Artikelnummer: - Start- / Endseite: 1353 - 1358 Identifikator: ISSN: 1367-4803