Inferential backbone assignment for sparse data

Comprehensive automation for NMR structure determination of proteins

This chapter gives an overview of automated protein structure determination by nuclear magnetic resonance (NMR) with the UNIO protocol that enables high to full automation of all NMR data analysis steps involved. Four established algorithms, namely, the MATCH algorithm for sequence-specific resonance assignment, the ASCAN algorithm for side-chain resonance assignment, the CANDID algorithm for NOE assignment, and the ATNOS algorithm for signal identification in NMR spectra, are assembled into three principal UNIO NMR data analysis components (MATCH, ATNOS/ASCAN, and ATNOS/CANDID) that are accessed thanks to a particularly intuitive and flexible, yet powerful graphical user interface (GUI). UNIO is designed to work independently or in association with other NMR software. The principal data analysis components for sequence-specific backbone, side-chain and NOE assignment may be run separately or out of sequence. User-intervention at individual stages is encouraged and facilitated by graphical tools included for the preparation, analysis, validation, and subsequent presentation of the NMR structure.

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

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.

Advances in automated NMR protein structure determination

Around half of all protein structures solved nowadays using solution-state nuclear magnetic resonance (NMR) spectroscopy have been because of automated data analysis. The pervasiveness of computational approaches in general hides, however, a more nuanced view in which the full variety and richness of the field appears. This review is structured around a comparison of methods associated with three NMR observables: classical nuclear Overhauser effect (NOE) constraint gathering in contrast with more recent chemical shift and residual dipole coupling (RDC) based protocols. In each case, the emphasis is placed on the latest research, covering mainly the past 5 years. By describing both general concepts and representative programs, the objective is to map out a field in which--through the very profusion of approaches--it is all too easy to lose one's bearings.

Highly automated protein backbone resonance assignment within a few hours: the "BATCH" strategy and software package

Sequential resonance assignment represents an essential step towards the investigation of protein structure, dynamics, and interaction surfaces. Although the experimental sensitivity has significantly increased in recent years, with the availability of high field magnets and cryogenically cooled probes, resonance assignment, even of small globular proteins, still generally requires several days of data collection and analysis using standard protocols. Here we introduce the BATCH strategy for fast and highly automated backbone resonance assignment of (13)C, (15)N-labelled proteins. BATCH makes use of the fast data acquisition and analysis tools BEST, ASCOM, COBRA, and HADAMAC, recently developed in our laboratory. An improved Hadamard encoding scheme, presented here, further increases the performance of the HADAMAC experiment. A new software platform, interfaced to the NMRView software package, has been developed that enables highly automated NMR data processing and analysis, sequential resonance assignment, and (13)C chemical shift extraction. We demonstrate for four small globular proteins that sequential resonance assignment can be routinely obtained within a few hours, or less, in a highly automated and robust way.

Automated structure determination from NMR spectra

Automated methods for protein structure determination by NMR have increasingly gained acceptance and are now widely used for the automated assignment of distance restraints and the calculation of three-dimensional structures. This review gives an overview of the techniques for automated protein structure analysis by NMR, including both NOE-based approaches and methods relying on other experimental data such as residual dipolar couplings and chemical shifts, and presents the FLYA algorithm for the fully automated NMR structure determination of proteins that is suitable to substitute all manual spectra analysis and thus overcomes a major efficiency limitation of the NMR method for protein structure determination.

Graphical interpretation of Boolean operators for protein NMR assignments

We have developed a graphics based algorithm for semi-automated protein NMR assignments. Using the basic sequential triple resonance assignment strategy, the method is inspired by the Boolean operators as it applies "AND"-, "OR"- and "NOT"-like operations on planes pulled out of the classical three-dimensional spectra to obtain its functionality. The method's strength lies in the continuous graphical presentation of the spectra, allowing both a semi-automatic peaklist construction and sequential assignment. We demonstrate here its general use for the case of a folded protein with a well-dispersed spectrum, but equally for a natively unfolded protein where spectral resolution is minimal.

Contact replacement for NMR resonance assignment

MOTIVATION

Complementing its traditional role in structural studies of proteins, nuclear magnetic resonance (NMR) spectroscopy is playing an increasingly important role in functional studies. NMR dynamics experiments characterize motions involved in target recognition, ligand binding, etc., while NMR chemical shift perturbation experiments identify and localize protein-protein and protein-ligand interactions. The key bottleneck in these studies is to determine the backbone resonance assignment, which allows spectral peaks to be mapped to specific atoms. This article develops a novel approach to address that bottleneck, exploiting an available X-ray structure or homology model to assign the entire backbone from a set of relatively fast and cheap NMR experiments.

RESULTS

We formulate contact replacement for resonance assignment as the problem of computing correspondences between a contact graph representing the structure and an NMR graph representing the data; the NMR graph is a significantly corrupted, ambiguous version of the contact graph. We first show that by combining connectivity and amino acid type information, and exploiting the random structure of the noise, one can provably determine unique correspondences in polynomial time with high probability, even in the presence of significant noise (a constant number of noisy edges per vertex). We then detail an efficient randomized algorithm and show that, over a variety of experimental and synthetic datasets, it is robust to typical levels of structural variation (1-2 AA), noise (250-600%) and missings (10-40%). Our algorithm achieves very good overall assignment accuracy, above 80% in alpha-helices, 70% in beta-sheets and 60% in loop regions.

AVAILABILITY

Our contact replacement algorithm is implemented in platform-independent Python code. The software can be freely obtained for academic use by request from the authors.