A Constraint Reasoning System for Automating Sequence-Specific Resonance Assignments from Multidimensional Protein NMR Spectra

AUTOASSIGN is a prototype expert system designed to aid in the determination of protein structure from nuclear magnetic resonance (NMR) measurements. In this paper we focus on one of the key steps of this process, the assignment of the observed NMR signals to specific atomic nuclei in the protein; i.e. the determination of sequence-specific resonance assignments. Recently developed triple-resonance (1H, 15N, and 13C) NMR experiments [Montelione et al., 1992] have provided an important breakthrough in this field, as the resulting data are more amenable to automated analysis than data sets generated using conventional strategies [Wuethrich, 1986]. The "assignment problem" can be stated as a constraint satisfaction problem (CSP) with some added complexities. There is very little internal structure to the problem, making it difficult to apply subgoaling and problem decomposition. Moreover, the data used to generate the constraints are incomplete, non-unique, and noisy, and constraints emerge dynamically as analysis progresses. The traditional inference engine is replaced by a set of very tightly-coupled modules which enforce extensive constraint propagation, with state information distributed over the objects whose relationships are being constrained. AUTOASSIGN provides correct and nearly complete resonance assignments with both simulated and real 3D triple-resonance data for a 72 amino acid protein.

[1]  K. Wüthrich NMR of proteins and nucleic acids , 1988 .

[2]  Irwin D. Kuntz,et al.  Programs for computer-assisted sequential assignment of proteins , 1989 .

[3]  G. Montelione,et al.  Conformation-independent sequential NMR connections in isotope-enriched polypeptides by 1H13C15N triple-resonance experiments , 1990 .

[4]  Irwin D. Kuntz,et al.  A program for semi-automatic sequential resonance assignments in protein 1H nuclear magnetic resonance spectra , 1988 .

[5]  Alan K. Mackworth Consistency in Networks of Relations , 1977, Artif. Intell..

[6]  L. Kay,et al.  A novel approach for sequential assignment of proton, carbon-13, and nitrogen-15 spectra of larger proteins: heteronuclear triple-resonance three-dimensional NMR spectroscopy. Application to calmodulin , 1990 .

[7]  G T Montelione,et al.  An improved strategy for determining resonance assignments for isotopically enriched proteins and its application to an engineered domain of staphylococcal protein A. , 1993, Biochemistry.

[8]  Hartmut Oschkinat,et al.  Computer-assisted assignment of multidimensional NMR spectra of proteins: Application to 3D NOESY-HMQC and TOCSY-HMQC spectra , 1993 .

[9]  B G Buchanan,et al.  Validation of the first step of the heuristic refinement method for the derivation of solution structures of proteins from NMR data , 1987, Proteins.

[10]  Martin C. Cooper An Optimal k-Consistency Algorithm , 1989, Artif. Intell..

[11]  T. Logan,et al.  Side chain and backbone assignments in isotopically labeled proteins from two heteronuclear triple resonance experiments , 1992, FEBS letters.

[12]  Gaetano T. Montelione,et al.  An efficient triple resonance experiment using carbon-13 isotropic mixing for determining sequence-specific resonance assignments of isotopically-enriched proteins , 1992 .

[13]  Gaetano T. Montelione,et al.  An HCCNH Triple-Resonance Experiment Using Carbon-13 Isotropic Mixing for Correlating Backbone Amide and Side-Chain Aliphatic Resonances in Isotopically Enriched Proteins , 1993 .

[14]  Pascal Van Hentenryck Constraint satisfaction in logic programming , 1989, Logic programming.

[15]  Brian Falkenhainer,et al.  Dynamic Constraint Satisfaction Problems , 1990, AAAI.