NMR assignment

Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics, and interactions in solution. A necessary first step required for such applications is determining the resonance assignment, mapping spectral data to atoms and residues in the primary sequence. Automated resonance assignment algorithms rely on information regarding connectivity (e.g. through-bond atomic interactions) and amino acid type. We are pursuing a graph-based approach that abstracts possible connectivity information as edges between residue vertices, based on possible matches between spectral peaks. The edges in the graph, in combination with sequence information, then drive the assignment process. Unfortunately there is a great deal of ambiguity in edges.

We are studying several problems and approaches in automated NMR resonance assignment. We are developing a random graph model capturing the correlation structure in ambiguous edges, and we are using this model as the basis for an efficient algorithm for characterizing, from connectivity information alone, consistent sets of connected fragments. Further, we are studying the combination of connectivity and sequence information and developing a Bayesian statistical model that properly accounts for sources of uncertainty. This model allows quantification of the overall amount of information used, which can vary widely across experimental labs. By measuring the overall plausibility of assignments, we can base our analysis on all assignments (not just the optimal one) that are supported by the data. Finally, we are pursuing an approach based on connectivity information in the unassigned NOESY (through-space) spectrum; for example, the above figure actually shows a portion of the connectivities in a beta sheet, as detected by the Jigsaw program. Our work here generalizes sequential connectivies to higher dimensions (2D and even 3D).

Papers

  • F. Xiong, G. Pandurangan, and C. Bailey-Kellogg, "Contact replacement for NMR resonance assignment", Proc. ISMB, 2008; published in Bioinformatics, 2008, 24:i105-i213. abstract. official version. preprint.
  • F. Xiong and C. Bailey-Kellogg, "A hierarchical grow-and-match algorithm for backbone resonance assignments given 3D structure", Proc. IEEE BIBE, 2007, pp. 403-410. abstract. preprint.
  • H. Kamisetty, C. Bailey-Kellogg, and G. Pandurangan, "An efficient randomized algorithm for contact-based NMR backbone resonance assignment", Bioinformatics, 2006, 22:172-80. abstract. official abstract. paper.
  • O. Vitek, C. Bailey-Kellogg, B. Craig, and J. Vitek, "Inferential backbone assignment for sparse data", J. Biomolecular NMR, 2006, 35:187-208. abstract. official version.
  • O. Vitek, C. Bailey-Kellogg, B. Craig, P. Kuliniewicz, J. Vitek, "Reconsidering complete search algorithms for protein backbone NMR assignment", Proc. ECCB, 2005, published in Bioinformatics, 2005, 21:ii230-236. abstract. pdf.
  • C. Bailey-Kellogg, S. Chainraj, and G. Pandurangan, "A Random Graph Approach to NMR Sequential Assignment", J. Comp. Biol., 2005, 12:569-583. paper.
    Conference version: Proc. RECOMB, 2004, pp. 58-67. abstract. pdf.
  • O. Vitek, J. Vitek, B. Craig, and C. Bailey-Kellogg, "Model-based assignment and inference of protein backbone nuclear magnetic resonances", Statistical Applications in Genetics and Molecular Biology, 2004, 3(1), article 6, 1-33. abstract. paper. local pdf.
  • C. Bailey-Kellogg, A. Widge, M.J. Berardi, J.H. Bushweller, and B.R. Donald, "The NOESY Jigsaw: automated protein secondary structure and main-chain assignment from sparse, unassigned NMR data," J. Computational Biology, 2000, 7:537-558. abstract. pdf.
    Conference version: Proc. RECOMB, 2000, pp. 33-44. abstract. postscript.

Current projects