title: An efficient randomized algorithm for contact-based NMR backbone resonance assignment.
abstract: BACKGROUND
  Backbone resonance assignment is a critical bottleneck in studies of protein structure, dynamics and interactions by nuclear magnetic resonance (NMR) spectroscopy. A minimalist approach to assignment, which we call 'contact-based', seeks to dramatically reduce experimental time and expense by replacing the standard suite of through-bond experiments with the through-space (nuclear Overhauser enhancement spectroscopy, NOESY) experiment. In the contact-based approach, spectral data are represented in a graph with vertices for putative residues (of unknown relation to the primary sequence) and edges for hypothesized NOESY interactions, such that observed spectral peaks could be explained if the residues were 'close enough'. Due to experimental ambiguity, several incorrect edges can be hypothesized for each spectral peak. An assignment is derived by identifying consistent patterns of edges (e.g. for alpha-helices and beta-sheets) within a graph and by mapping the vertices to the primary sequence. The key algorithmic challenge is to be able to uncover these patterns even when they are obscured by significant noise.
  
  
  RESULTS
  This paper develops, analyzes and applies a novel algorithm for the identification of polytopes representing consistent patterns of edges in a corrupted NOESY graph. Our randomized algorithm aggregates simplices into polytopes and fixes inconsistencies with simple local modifications, called rotations, that maintain most of the structure already uncovered. In characterizing the effects of experimental noise, we employ an NMR-specific random graph model in proving that our algorithm gives optimal performance in expected polynomial time, even when the input graph is significantly corrupted. We confirm this analysis in simulation studies with graphs corrupted by up to 500% noise. Finally, we demonstrate the practical application of the algorithm on several experimental beta-sheet datasets. Our approach is able to eliminate a large majority of noise edges and to uncover large consistent sets of interactions.
  
  
  BACKGROUND
  Our algorithm has been implemented in the platform-independent Python code. The software can be freely obtained for academic use by request from the authors.
authors.affiliation: Department of Computer Science, Purdue University West Lafayette, IN 47907, USA.
authors.forename: Hetunandan
authors.initials: H
authors.lastname: Kamisetty
authors.forename: Chris
authors.initials: C
authors.lastname: Bailey-Kellogg
authors.forename: Gopal
authors.initials: G
authors.lastname: Pandurangan
mesh_terms: D000465:Algorithms; D000595:Amino Acid Sequence; D001665:Binding Sites; D009682:Magnetic Resonance Spectroscopy / Q000379:methods*; D008956:Models, Chemical; D008958:Models, Molecular; D015233:Models, Statistical; D008969:Molecular Sequence Data; D010363:Pattern Recognition, Automated / Q000379:methods*; D011485:Protein Binding; D017433:Protein Structure, Secondary; D011506:Proteins / Q000032:analysis* / Q000737:chemistry* / Q000145:classification; D020539:Sequence Analysis, Protein / Q000379:methods*
chemical_list: D011506:Proteins