Thread: Iterative algorithm of discrete Fourier transform for processing randomly sampled NMR
View Single Post
  #1  
Unread 08-14-2010, 04:19 AM
nmrlearner's Avatar
nmrlearner nmrlearner is offline
Senior Member
  
Join Date: Jan 2005
Posts: 23,191
Points: 193,617, Level: 100
Points: 193,617, Level: 100 Points: 193,617, Level: 100 Points: 193,617, Level: 100
Level up: 0%, 0 Points needed
Level up: 0% Level up: 0% Level up: 0%
Activity: 50.7%
Activity: 50.7% Activity: 50.7% Activity: 50.7%
Last Achievements
Award-Showcase
NMR Credits: 0
NMR Points: 0
Downloads: 0
Uploads: 0
Default Iterative algorithm of discrete Fourier transform for processing randomly sampled NMR
Abstract Spectra obtained by application of multidimensional Fourier Transformation (MFT) to sparsely sampled nD NMR signals are usually corrupted due to missing data. In the present paper this phenomenon is investigated on simulations and experiments. An effective iterative algorithm for artifact suppression for sparse on-grid NMR data sets is discussed in detail. It includes automated peak recognition based on statistical methods. The results enable one to study NMR spectra of high dynamic range of peak intensities preserving benefits of random sampling, namely the superior resolution in indirectly measured dimensions. Experimental examples include 3D 15N- and 13C-edited NOESY-HSQC spectra of human ubiquitin.
  • Content Type Journal Article
  • DOI 10.1007/s10858-010-9411-2
  • Authors
    • Jan Stanek, University of Warsaw Faculty of Chemistry Pasteura 1 02-093 Warsaw Poland
    • Wiktor KoźmiÅ?ski, University of Warsaw Faculty of Chemistry Pasteura 1 02-093 Warsaw Poland

Source: Journal of Biomolecular NMR
Reply With Quote

Did you find this post helpful? Yes | No