Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

John H. Bushweller

dblp:65/2453 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2000
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › structural biology
NMR structure determination
0.012000
The NOESY jigsaw: automated protein secondary structure and main-chain assignment from sparse, unassigned NMR data · RECOMB 2000
Bioinformatics and computational biology › structural bioinformatics
protein structure determination
0.012000
The NOESY jigsaw: automated protein secondary structure and main-chain assignment from sparse, unassigned NMR data · RECOMB 2000
Bioinformatics and computational biology
structural bioinformatics
0.012000
The NOESY jigsaw: automated protein secondary structure and main-chain assignment from sparse, unassigned NMR data · RECOMB 2000
Graph algorithms and graph theory
graph algorithms
0.012000
The NOESY jigsaw: automated protein secondary structure and main-chain assignment from sparse, unassigned NMR data · RECOMB 2000
Graph algorithms and graph theory › graph algorithms
graph pattern matching
0.012000
The NOESY jigsaw: automated protein secondary structure and main-chain assignment from sparse, unassigned NMR data · RECOMB 2000

Methods — techniques the papers use, named apart from their topics

probabilistic reasoning · 0.1graph algorithms · 0.1
YearPublicationVenuePosition
2000 The NOESY jigsaw: automated protein secondary structure and main-chain assignment from sparse, unassigned NMR data
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 high-throughput, 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. JIGSAW's deferment of assignment until after secondary structure identification differs greatly from traditional approaches, which begin by correlating peaks among dozens of experiments. By deferring assignment, JIGSAW not only eliminates this bottleneck, it also allows the number of experiments to be reduced from dozens to four, none of which requires 13 C-labeled protein. This in turn dramatically reduces the amount and expense of wet lab molecular biology for protein expression and purification, as well as the total spectrometer time to collect data.Our results for three test proteins demonstrate that we are able to identify and align approximately 80 percent of a-helical and 60 percent of b-sheet structure. JIGSAW is very fast, running in minutes on a Pentium-class Linux workstation. This approach yields quick and reasonably accurate (as opposed to the traditional slow and extremely accurate) structure calculations, utilizing a suite of graph analysis algorithms to compensate for the data sparseness. JIGSAW could be used for quick structural assays to speed data to the biologist early in the process of investigation, and could in principle be applied in an automation-like fashion to a large fraction of the proteome.
Chris Bailey-Kellogg, Alik Widge, John J. Kelley 0001, Marcelo J. Berardi, John H. Bushweller, Bruce Randall Donald
RECOMB5