孕期暴露于THC的成年老鼠后代表现出明显的生物分子变化,通过X射线光成像和福里埃变换红外光谱在皮层-边缘电路中识别出明显的生物分子变化
Tallan Black1,2, Rhiannon E Boseley3,4,5, Amanda Quirk4
1College of Pharmacy and Nutrition, University of Saskatchewan, 107 Wiggins Road, Saskatoon, Saskatchewan S7N 5E5, Canada.
ACS chemical neuroscience
|February 9, 2026
概括
怀孕期间使用大麻,特别是接触THC,会改变胎儿大脑脂质组成和金属度. 这些变化可能是后代观察到的神经发育差异的基础.
科学领域:
- 神经科学是一个神经科学.
- 生物化学 生物化学
- 毒理学 毒理学 毒理学
背景情况:
- 在怀孕期间使用大麻越来越普遍.
- Δ9-四大麻 (THC) 可能会影响胎儿大脑脂质生物化学.
- 之前的研究在暴露于THC的后代中发现了不同的行为表型.
研究的目的:
- 为了研究妊娠THC暴露后胎儿大脑中的生化和生物分子变化.
- 利用多式生物谱成像 (XFI和FTIR) 来检测这些变化.
- 为了将观察到的生化变化与先前识别的行为表型相关联.
主要方法:
- 用X射线光成像 (XFI) 来评估金属和元素失调.
- 里叶变换中红外光谱显微镜 (FTIR) 用于分析神经化学组成.
- 来自THC暴露后代和车辆暴露对照的脑组织的比较.
主要成果:
- THC后代通过XFI.显示在体中铜 (Cu) 减少.
- FTIR揭示了海马体中脂肪,碳水化合物和胆固醇的变化.
- 在特定的大脑区域观察到脂质结构变化和蛋白质的微妙增加.
结论:
- 多模式生物光谱成像有效地检测到脑组织中微妙的生物分子变化.
- 孕期THC暴露会在发育中的胎儿大脑中诱导特定的生化变化.
- 这些发现有助于理解THC对神经发育的复杂影响.
相关概念视频
Fast Fourier Transform
966
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
966
Properties of Fourier Transform I
682
The application of Fourier Transform properties in radio broadcasting is multifaceted, enabling significant advancements in the way signals are transmitted and received. Key areas where these properties are utilized include simultaneous multi-channel transmission, audio clip speed adjustments, live broadcast delays for different time zones, audio frequency adjustments, and signal demodulation.
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
682
Properties of Fourier Transform II
789
The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
789
Discrete Fourier Transform
922
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
922
Basic signals of Fourier Transform
962
The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at...
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at...
962
Continuous -time Fourier Transform
921
The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
921


