Optimal bundling of transmembrane helices using sparse distance constraints.

Protein Sci

Biosystems Research Department, Sandia National Laboratories, P.O. Box 969, MS 9951, Livermore CA 94551-0969, USA.

Published: October 2004

We present a two-step approach to modeling the transmembrane spanning helical bundles of integral membrane proteins using only sparse distance constraints, such as those derived from chemical cross-linking, dipolar EPR and FRET experiments. In Step 1, using an algorithm, we developed, the conformational space of membrane protein folds matching a set of distance constraints is explored to provide initial structures for local conformational searches. In Step 2, these structures refined against a custom penalty function that incorporates both measures derived from statistical analysis of solved membrane protein structures and distance constraints obtained from experiments. We begin by describing the statistical analysis of the solved membrane protein structures from which the theoretical portion of the penalty function was derived. We then describe the penalty function, and, using a set of six test cases, demonstrate that it is capable of distinguishing helical bundles that are close to the native bundle from those that are far from the native bundle. Finally, using a set of only 27 distance constraints extracted from the literature, we show that our method successfully recovers the structure of dark-adapted rhodopsin to within 3.2 A of the crystal structure.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2286557PMC
http://dx.doi.org/10.1110/ps.04781504DOI Listing

Publication Analysis

Top Keywords

distance constraints
20
membrane protein
12
penalty function
12
sparse distance
8
helical bundles
8
set distance
8
statistical analysis
8
analysis solved
8
solved membrane
8
protein structures
8

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!