Simple Fast Quantification of Cholecalciferol, 25-Hydroxyvitamin D and 1,25-Dihydroxyvitamin D in Adipose Tissue

Laurianne Bonnet1, Marielle Margier1, Ljubica Svilar2

  • 1C2VN (Centre de Recherche CardioVasculaire et Nutrition), INRA, INSERM, Université d'Aix-Marseille, Faculté de Médecine, 27 Bd Jean Moulin, 13385 Marseille CEDEX 05, France.

Nutrients
|August 25, 2019
PubMed

Related Concept Videos

High-Resolution Mass Spectrometry (HRMS)01:15

High-Resolution Mass Spectrometry (HRMS)

The resolution of a mass spectrometer depends on the efficiency of separating ions with different ion masses. The mass of an atom is approximated to the sum of the masses of protons and neutrons inside, considering the masses of protons and neutrons as equal. However, the masses of the proton (1.6726 × 10−24 g) and neutron (1.6749 × 10−24 g) are not truly equal. There is a minor error in the expression of atomic masses relative to the simplest atom of hydrogen. For...
2.4K
Classification of Epithelial Tissues: Simple Epithelium01:30

Classification of Epithelial Tissues: Simple Epithelium

Simple epithelium consists of a single layer of cells that lines body cavities and blood vessels. The shape of the cells in the epithelium reflects the function of the tissue. Cells in simple squamous epithelium appear as thin scales with flat, elliptical nuclei that mirror the form of the cell.
Because of the thinness of the cells, simple squamous epithelium is present where the rapid passage of chemical compounds is observed. For example, the endothelium that lines the capillaries and vessels...
12.8K
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
912
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
8.0K
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

3.4K
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
734