Evidence map›Paper›PMID 21706248›Full record

ArticleJournal of biomolecular NMR2011

Protein side-chain resonance assignment and NOE assignment using RDC-defined backbones without TOCSY data.

Jianyang Zeng, Pei Zhou, Bruce Randall Donald

Abstract read
In one paragraph

Article in Journal of biomolecular NMR, 2011. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 6 papers.

0numbers the graph read from it
0cells of the map it votes in
6citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

6 citing papers in PubMed.

  1. Article
  2. Drug-target interaction prediction by integrating chemical, genomic, functional and pharmacological data.Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing · 2014
    Article
  3. Article
  4. Article
  5. Article
  6. A Bayesian approach for determining protein side-chain rotamer conformations using unassigned NOE data.Journal of computational biology : a journal of computational molecular cell biology · 2011
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Jianyang ZengDepartment of Computer Science, Duke University, Durham, NC 27708, USA.
Pei Zhou
Bruce Randall Donald

Funding

Computational Structure-Based Protein DesignR01GM078031 · NIGMS · DUKE UNIVERSITY · PI DONALD, BRUCE R. · 2008 to 2021
$4.3M
Automated NMR Assignment and Protein Structure DeterminationR01GM065982 · NIGMS · DUKE UNIVERSITY · PI DONALD, BRUCE R. · 2002 to 2011
$2.7M
Structural, Biochemical and Functional Studies of RNAPII CTD Interacting ProteinsR01GM079376 · NIGMS · DUKE UNIVERSITY · PI ZHOU, PEI · 2008 to 2011
$1.2M
NIGMS NIH HHS R01 GM065982NIGMS NIH HHS R01 GM078031NIGMS NIH HHS R01 GM-079376NIGMS NIH HHS R01 GM079376NIGMS NIH HHS R01 GM-65982NIGMS NIH HHS R01 GM-78031
6 · The paper itself

Abstract

One bottleneck in NMR structure determination lies in the laborious and time-consuming process of side-chain resonance and NOE assignments. Compared to the well-studied backbone resonance assignment problem, automated side-chain resonance and NOE assignments are relatively less explored. Most NOE assignment algorithms require nearly complete side-chain resonance assignments from a series of through-bond experiments such as HCCH-TOCSY or HCCCONH. Unfortunately, these TOCSY experiments perform poorly on large proteins. To overcome this deficiency, we present a novel algorithm, called NASCA: (NOE Assignment and Side-Chain Assignment), to automate both side-chain resonance and NOE assignments and to perform high-resolution protein structure determination in the absence of any explicit through-bond experiment to facilitate side-chain resonance assignment, such as HCCH-TOCSY. After casting the assignment problem into a Markov Random Field (MRF), NASCA: extends and applies combinatorial protein design algorithms to compute optimal assignments that best interpret the NMR data. The MRF captures the contact map information of the protein derived from NOESY spectra, exploits the backbone structural information determined by RDCs, and considers all possible side-chain rotamers. The complexity of the combinatorial search is reduced by using a dead-end elimination (DEE) algorithm, which prunes side-chain resonance assignments that are provably not part of the optimal solution. Then an A* search algorithm is employed to find a set of optimal side-chain resonance assignments that best fit the NMR data. These side-chain resonance assignments are then used to resolve the NOE assignment ambiguity and compute high-resolution protein structures. Tests on five proteins show that NASCA: assigns resonances for more than 90% of side-chain protons, and achieves about 80% correct assignments. The final structures computed using the NOE distance restraints assigned by NASCA: have backbone RMSD 0.8-1.5 Å from the reference structures determined by traditional NMR approaches.

Indexed as

AlgorithmsSoftwareHumansMarkov ChainsModels, MolecularNuclear Magnetic Resonance, BiomolecularProtein ConformationProteinsProteins

Identifiers

PMID21706248
PMCPMC3155202

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.