Efficient and generalized processing of multidimensional NUS NMR data: the NESTA algorithm and comparison of regularization terms.
J Biomol NMR. 2015 Mar 26;
Authors: Sun S, Gill M, Li Y, Huang M, Byrd RA
Abstract
The advantages of non-uniform sampling (NUS) in offering time savings and resolution enhancement in NMR experiments have been increasingly recognized. The possibility of sensitivity gain by NUS has also been demonstrated. Application of NUS to multidimensional NMR experiments requires the selection of a sampling scheme and a reconstruction scheme to generate uniformly sampled time domain data. In this report, an efficient reconstruction scheme is presented and used to evaluate a range of regularization algorithms that collectively yield a generalized solution to processing NUS data in multidimensional NMR experiments. We compare l1-norm (L1), iterative re-weighted l1-norm (IRL1), and Gaussian smoothed l0-norm (Gaussian-SL0) regularization for processing multidimensional NUS NMR data. Based on the reconstruction of different multidimensional NUS NMR data sets, L1 is demonstrated to be a fast and accurate reconstruction method for both quantitative, high dynamic range applications (e.g. NOESY) and for all J-coupled correlation experiments. Compared to L1, both IRL1 and Gaussian-SL0 are shown to produce slightly higher quality reconstructions with improved linearity in peak intensities, albeit with a computational cost. Finally, a generalized processing system, NESTA-NMR, is described that utilizes a fast and accurate first-order gradient descent algorithm (NESTA) recently developed in the compressed sensing field. NESTA-NMR incorporates L1, IRL1, and Gaussian-SL0 regularization. NESTA-NMR is demonstrated to provide an efficient, streamlined approach to handling all types of multidimensional NMR data using proteins ranging in size from 8 to 32*kDa.
PMID: 25808220 [PubMed - as supplied by publisher]
Efficient and generalized processing of multidimensional NUS NMR data: the NESTA algorithm and comparison of regularization terms
Efficient and generalized processing of multidimensional NUS NMR data: the NESTA algorithm and comparison of regularization terms
Abstract
The advantages of non-uniform sampling (NUS) in offering time savings and resolution enhancement in NMR experiments have been increasingly recognized. The possibility of sensitivity gain by NUS has also been demonstrated. Application of NUS to multidimensional NMR experiments requires the selection of a sampling scheme and a reconstruction scheme to generate uniformly sampled time domain data. In this report, an...
nmrlearner
Journal club
0
03-25-2015 10:58 PM
Nonuniform sampling and non-Fourier signal processing methods in multidimensional NMR
Nonuniform sampling and non-Fourier signal processing methods in multidimensional NMR
Publication date: Available online 13 October 2014
Source:Progress in Nuclear Magnetic Resonance Spectroscopy</br>
Author(s): Mehdi Mobli , Jeffrey C. Hoch</br>
Beginning with the introduction of Fourier Transform NMR by Ernst and Anderson in 1966, time domain measurement of the impulse response (the free induction decay, FID) consisted of sampling the signal at a series of discrete intervals. For compatibility with the discrete Fourier transform (DFT), the intervals are kept...
nmrlearner
Journal club
0
10-14-2014 04:35 AM
[NMR paper] A comparison of convex and non-convex compressed sensing applied to multidimensional NMR.
A comparison of convex and non-convex compressed sensing applied to multidimensional NMR.
http://www.bionmr.com//www.ncbi.nlm.nih.gov/corehtml/query/egifs/http:--linkinghub.elsevier.com-ihub-images-PubMedLink.gif Related Articles A comparison of convex and non-convex compressed sensing applied to multidimensional NMR.
J Magn Reson. 2012 Oct;223:1-10
Authors: Kazimierczuk K, Orekhov VY
Abstract
The resolution of multidimensional NMR spectra can be severely limited when regular sampling based on the Nyquist-Shannon theorem is used. The...
nmrlearner
Journal club
0
02-23-2013 01:51 PM
[NMR paper] An efficient branch-and-bound algorithm for the assignment of protein backbone NMR pe
An efficient branch-and-bound algorithm for the assignment of protein backbone NMR peaks.
Related Articles An efficient branch-and-bound algorithm for the assignment of protein backbone NMR peaks.
Proc IEEE Comput Soc Bioinform Conf. 2002;1:165-74
Authors: Lin G, Xu D, Chen ZZ, Jiang T, Wen J, Xu Y
NMR resonance assignment is one of the key steps in solving an NMR protein structure. The assignment process links resonance peaks to individual residues of the target protein sequence, providing the prerequisite for establishing intra- and...
nmrlearner
Journal club
0
11-24-2010 08:49 PM
[NMR paper] A branch and bound algorithm for protein structure refinement from sparse NMR data se
A branch and bound algorithm for protein structure refinement from sparse NMR data sets.
http://www.ncbi.nlm.nih.gov/corehtml/query/egifs/http:--linkinghub.elsevier.com-ihub-images-PubMedLink.gif Related Articles A branch and bound algorithm for protein structure refinement from sparse NMR data sets.
J Mol Biol. 1999 Jan 29;285(4):1691-710
Authors: Standley DM, Eyrich VA, Felts AK, Friesner RA, McDermott AE
We describe new methods for predicting protein tertiary structures to low resolution given the specification of secondary structure and a...
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...