English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  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

Basic

show hide
Item Permalink: http://hdl.handle.net/11858/00-001M-0000-0010-846A-1 Version Permalink: http://hdl.handle.net/11858/00-001M-0000-0010-846B-0
Genre: Journal Article

Files

show Files
hide Files
:
1353.pdf (Any fulltext), 369KB
 
File Permalink:
-
Name:
1353.pdf
Description:
-
Visibility:
Restricted (Max Planck Institute for Molecular Genetics, MBMG; )
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
eDoc_access: INSTITUT
License:
-

Locators

show

Creators

show
hide
 Creators:
Paszkiewicz, Konrad H., Author
Sternberg, Michael J. E., Author
Lappe, Michael1, Author              
Affiliations:
1Independent Junior Research Groups (OWL), Max Planck Institute for Molecular Genetics, Max Planck Society, ou_1433554              

Content

show
hide
Free keywords: -
 Abstract: 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

show
hide
Language(s): eng - English
 Dates: 2006-03-16
 Publication Status: Published in print
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Method: -
 Identifiers: eDoc: 305754
DOI: 10.1093/bioinformatics/btl095
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Bioinformatics
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 22 (1) Sequence Number: - Start / End Page: 1353 - 1358 Identifier: ISSN: 1367-4803