TY - GEN
T1 - A Constraint Reasoning System for Automating Sequence-Specific Resonance Assignments from Multidimensional Protein NMR Spectra
AU - Zimmerman, Diane E.
AU - Kulikowski, Casimir A.
AU - Montelione, Gaetano T.
N1 - Funding Information:
The basic nuclear magnetic resonance experiment yields a one-dimensional spectrum of peaks reflecting the different frequencies at which various nuclei *Support for this work was provided in part by grants from The National Institutes of Health (GM-47014)a nd The National Science Foundation (DIi~-9019313). D.Z. was supported by a Biotechnology T~aining Grant from The National Institute~ of Health (GM-08339) The process of protein structure determination by NMRin volves four principal steps [Wuethrich, 1986]. In the first step, networks of protons which interact with one another through chemical bonds are identified. Each such network is called a proton spin system, and corresponds to a separate - but as yet uniden-tiffed - amino acid in the protein. Next, sequence-specific assignments for these spin systems are determined by establishing their respective positions in the polypeptide sequence. In the third step, conformational constraints axe generated by correlating the fhrougl~-space interactions detected in nuclear Over-hauser effect (NOE) experiments with the resonance frequencies identified in the previous two steps. Finally, structure generation programs axe used to compute three-dimensional models of the protein satisfying these conformational constraints. AI systems have been developed which perform this last step [Lichtaxge e~ al., 1987]; [Edwards e~ al., 1992]. AU-TOASSIGiNs an object-oriented expert system which uses constraint reasoning to solve the second step, i.e. the sequential assignment problem.
Funding Information:
Support for this work was provided in part by grants from The National Institutes of Health (GM-47014) and The National Science Foundation (DIR-9019313). D.Z. was supported by a Biotechnology Training Grant from The National Institutes of Health (GM-08339)
Publisher Copyright:
Copyright © 1993, AAAI (www.aaai.org). All rights reserved.
PY - 1993
Y1 - 1993
N2 - 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 sequencespecific 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 tripleresonance data for a 72 amino acid protein.
AB - 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 sequencespecific 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 tripleresonance data for a 72 amino acid protein.
UR - http://www.scopus.com/inward/record.url?scp=0027901975&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0027901975&partnerID=8YFLogxK
M3 - Conference contribution
C2 - 7584369
AN - SCOPUS:0027901975
T3 - Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology, ISMB 1993
SP - 447
EP - 455
BT - Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology, ISMB 1993
PB - AAAI press
T2 - 1st International Conference on Intelligent Systems for Molecular Biology, ISMB 1993
Y2 - 6 July 1993 through 9 July 1993
ER -