GARANT-a general algorithm for resonance assignment of multidimensional nuclear magnetic resonance spectra

✍ Scribed by Bartels, Christian; G�ntert, Peter; Billeter, Martin; W�thrich, Kurt

• Publisher: John Wiley and Sons
• Year: 1997
• Tongue: English
• Weight: 341 KB
• Volume: 18
• Category: Article
• ISSN: 0192-8651
• DOI: 10.1002/(sici)1096-987x(19970115)18:1<139::aid-jcc13>3.0.co;2-h

✦ Synopsis

A new program for automatic resonance assignment of nuclear magnetic Ž . Ž resonance NMR spectra of proteins, GARANT General Algorithm for . Resonance AssignmeNT , is introduced. Three principal elements used in this Ž . approach are: a representation of resonance assignments as an optimal match of two graphs describing, respectively, peaks expected from combined knowledge of the primary structure and the magnetization transfer pathways in Ž . the spectra used, and experimentally observed peaks; b a scoring scheme able Ž . to distinguish between correct and incorrect resonance assignments; and c combination of an evolutionary algorithm with a local optimization routine. The score that evaluates the match of expected peaks to observed peaks relies on the agreement of the information available about these peaks, most prominently, but not exclusively, the chemical shifts. Tests show that the combination of an evolutionary algorithm and a local optimization routine yields results that are clearly superior to those obtained when using either of the two techniques separately in the search for the correct assignments. GARANT is laid out for assignment problems involving peaks observed in two-and three-dimensional homonuclear and heteronuclear NMR spectra of proteins.