{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T15:58:29Z","timestamp":1692547109787},"reference-count":22,"publisher":"Oxford University Press (OUP)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006,1,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: 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 \u2018contact-based\u2019, 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 \u2018close enough\u2019. 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 \u03b1-helices and \u03b2-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.<\/jats:p>\n               <jats:p>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 \u03b2-sheet datasets. Our approach is able to eliminate a large majority of noise edges and to uncover large consistent sets of interactions.<\/jats:p>\n               <jats:p>Availability: 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.<\/jats:p>\n               <jats:p>Contact: \u00a0cbk@cs.dartmouth.edu<\/jats:p>","DOI":"10.1093\/bioinformatics\/bti786","type":"journal-article","created":{"date-parts":[[2005,11,16]],"date-time":"2005-11-16T03:08:21Z","timestamp":1132110501000},"page":"172-180","source":"Crossref","is-referenced-by-count":11,"title":["An efficient randomized algorithm for contact-based NMR backbone resonance assignment"],"prefix":"10.1093","volume":"22","author":[{"given":"Hetunandan","family":"Kamisetty","sequence":"first","affiliation":[{"name":"Department of Computer Science, Purdue University 1 \u00a0 1 \u00a0 \u00a0 West Lafayette, IN 47907, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Bailey-Kellogg","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Dartmouth College 2 \u00a0 2 \u00a0 \u00a0 Hanover, NH 03755, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gopal","family":"Pandurangan","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Purdue University 1 \u00a0 1 \u00a0 \u00a0 West Lafayette, IN 47907, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2005,11,15]]},"reference":[{"key":"2023012408303388400_b1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","article-title":"Fast probabilistic algorithms for Hamiltonian circuits and matchings","volume":"18","author":"Angluin","year":"1979","journal-title":"J. Comp. Syst. Sci."},{"key":"2023012408303388400_b2","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1089\/106652700750050934","article-title":"The NOESY Jigsaw: automated protein secondary structure and main-chain assignment from sparce, unassigned NMR data","volume":"7","author":"Bailey-Kellogg","year":"2000","journal-title":"J. Comp. Biol."},{"key":"2023012408303388400_b3","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1089\/cmb.2005.12.569","article-title":"A random graph approach to NMR sequential assignment","volume":"12","author":"Bailey-Kellogg","year":"2005","journal-title":"J. Comp. Biol."},{"key":"2023012408303388400_b4","article-title":"Rapid protein structure detection and assignment using residual dipolar couplings","volume-title":"Technical Report CMU-CS-02-195","author":"Erdmann","year":"2002"},{"key":"2023012408303388400_b5","volume-title":"An Introduction to Probability Theory and its Applications","author":"Feller","year":"1968","edition":"3rd edn"},{"key":"2023012408303388400_b6","volume-title":"Probability and Random Processes","author":"Grimmett","year":"1992","edition":"2nd edn"},{"key":"2023012408303388400_b7","doi-asserted-by":"crossref","first-page":"6707","DOI":"10.1073\/pnas.082114199","article-title":"CLOUDS, a protocol for deriving a molecular proton density via NMR","volume":"99","author":"Grishaev","year":"2002","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023012408303388400_b8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1008318805889","article-title":"Sequence-specific NMR assignment of proteins by global fragment mapping with program Mapper","volume":"17","author":"G\u00fcntert","year":"2000","journal-title":"J. Biomol. NMR"},{"key":"2023012408303388400_b9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/B:JNMR.0000019247.89110.e6","article-title":"An expectation\/maximization nuclear vector replacement algorithm for automated NMR resonance assignments","volume":"29","author":"Langmead","year":"2004","journal-title":"J. Biomol. NMR"},{"key":"2023012408303388400_b10","first-page":"165","article-title":"A branch-and-bound algorithm for assignment of protein backbone NMR peaks","author":"Lin","year":"2002"},{"key":"2023012408303388400_b11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1023\/B:JNMR.0000042948.12381.88","article-title":"From NMR chemical shifts to amino acid types: investigation of the predictive power carried by nuclei","volume":"30","author":"Marin","year":"2004","journal-title":"J. Biomol. NMR"},{"key":"2023012408303388400_b12","doi-asserted-by":"crossref","first-page":"982","DOI":"10.1038\/80768","article-title":"Protein NMR spectroscopy in structural genomics","volume":"7","author":"Montelione","year":"2000","journal-title":"Nat. Struct. Biol."},{"key":"2023012408303388400_b13","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/S0959-440X(99)00019-6","article-title":"Automated analysis of NMR assignments and structures for proteins","volume":"9","author":"Moseley","year":"1999","journal-title":"Curr. Opin. Struct. Biol."},{"key":"2023012408303388400_b14","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1016\/S0006-3495(91)82326-8","article-title":"Implementation of the main chain directed assignment strategy","volume":"59","author":"Nelson","year":"1991","journal-title":"Biophys. J."},{"key":"2023012408303388400_b15","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/j.ipl.2005.04.001","article-title":"On a simple randomized algorithm for finding a 2-factor in sparse graphs","volume":"95","author":"Pandurangan","year":"2005","journal-title":"Inform. Process. Lett."},{"key":"2023012408303388400_b16","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1023\/A:1008338605320","article-title":"RESCUE: an artificial neural network tool for the NMR spectral assignment of proteins","volume":"15","author":"Pons","year":"1999","journal-title":"J. Biomol. NMR"},{"key":"2023012408303388400_b17","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF01875516","article-title":"A relational database for sequence-specific protein NMR data","volume":"1","author":"Seavey","year":"1991","journal-title":"J. Biomol. NMR"},{"key":"2023012408303388400_b18","doi-asserted-by":"crossref","first-page":"7272","DOI":"10.1021\/bi00397a012","article-title":"Two-dimensional 1H NMR study of human ubiquitin: a main-chain directed assignment and structure analysis","volume":"26","author":"Stefano","year":"1987","journal-title":"Biochemistry"},{"key":"2023012408303388400_b19","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1126\/science.1066011","article-title":"Global efforts in structural genomics","volume":"294","author":"Stevens","year":"2001","journal-title":"Science"},{"key":"2023012408303388400_b20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2202\/1544-6115.1037","article-title":"Model-based assignment and inference of protein backbone nuclear magnetic resonances","volume":"3","author":"Vitek","year":"2004","journal-title":"Stat. Appl. Genet. Mol. Biol."},{"key":"2023012408303388400_b21","doi-asserted-by":"crossref","first-page":"ii230","DOI":"10.1093\/bioinformatics\/bti1138","article-title":"Reconsidering complete search algorithms for protein backbone NMR Assignment","volume":"21","author":"Vitek","year":"2005","journal-title":"Bioinformatics"},{"key":"2023012408303388400_b22","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1006\/jmbi.1997.1052","article-title":"Automated analysis of protein NMR assignments using methods from artificial intelligence","volume":"269","author":"Zimmerman","year":"1997","journal-title":"J. Mol. Biol."}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/22\/2\/172\/48838299\/bioinformatics_22_2_172.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/22\/2\/172\/48838299\/bioinformatics_22_2_172.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T08:35:56Z","timestamp":1674549356000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/22\/2\/172\/425221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11,15]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,1,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bti786","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2006,1,15]]},"published":{"date-parts":[[2005,11,15]]}}}