The NOESY Jigsaw: Automated Protein Secondary Structure and Main-Chain Assignment from Sparse, Unassigned NMR Data (2000)
Cached
Download Links
| Venue: | JOURNAL OF COMPUTATIONAL BIOLOGY, 7:537–558, 2000 |
| Citations: | 35 - 14 self |
BibTeX
@MISC{Bailey-Kellogg00thenoesy,
author = {Chris Bailey-Kellogg and Alik Widge and John J. Kelley and III and Bruce Randall Donald and et al.},
title = {The NOESY Jigsaw: Automated Protein Secondary Structure and Main-Chain Assignment from Sparse, Unassigned NMR Data},
year = {2000}
}
OpenURL
Abstract
High-throughput, data-directed computational protocols for Structural Genomics (or Proteomics) are required in order to evaluate the protein products of genes for structure and function at rates comparable to current gene-sequencing technology. This paper presents the Jigsaw algorithm, a novel highthroughput, automated approach to protein structure characterization with nuclear magnetic resonance (NMR). Jigsaw applies graph algorithms and probabilistic reasoning techniques, enforcing first-principles consistency rules in order to overcome a 5-10 % signal-to-noise ratio. It consists of two main components: (1) graph-based secondary structure pattern identification in unassigned heteronuclear NMR data, and (2) assignment of spectral peaks by probabilistic alignment of identified secondary structure elements against the primary sequence. Deferring assignment eliminates the bottleneck faced by traditional approaches, which begin by correlating peaks among dozens of experiments. Jigsaw utilizes only four experiments, none of which requires 13 C-labeled protein, thus dramatically reducing both the amount and expense of wet lab molecular biology and the total spectrometer time. Results for three test proteins demonstrate that Jigsaw correctly identifies 79-100 % of α-helical and 46-65 % of β-sheet NOE connectivities, and correctly aligns 33-100 % of secondary structure elements. Jigsaw is very fast, running in







