在使用快速非线性NMA和FFT基于AFMFit搜索的AFM数据中解读构造动态.
Rémi Vuillemot1, Jean-Luc Pellequer2, Sergei Grudinin3
1Univ. Grenoble Alpes, CNRS, Grenoble INP, LJK, Grenoble, France.
Communications biology
|September 29, 2025
概括
AFMfit从原子力显微镜 (AFM) 数据中分析了蛋白质结构动力学. 这种新方法有效地解释2D AFM图像,以揭示单个分子水平的3D蛋白质运动.
科学领域:
- 生物物理学的生物物理.
- 结构生物学 结构生物学
- 计算生物学 计算生物学
背景情况:
- 原子力显微镜 (AFM) 能够在近乎生理条件下对蛋白质动态进行单分子研究.
- 将2D AFM数据解释为单个分子的3D结构动态是一个重大挑战.
- 现有的方法难以处理大型数据集和高速AFM (HS-AFM) 成像.
研究的目的:
- 开发一种用于解释AFM数据的计算方法,以揭示蛋白质结构动态.
- 创建一个灵活的装配程序,使原子模型变形以匹配多个AFM观测.
- 为了分析更大的AFM数据集,包括来自HS-AFM的数据集.
主要方法:
- 灵活的装配程序AFMfit将输入的原子模型变形,使其与多个AFM观测结果相匹配.
- 使用基于非线性正常模式分析 (NMA) 的快速拟合算法,称为NOLB.
- 在单个工作站上快速处理单个分子的数百张AFM图像.
主要成果:
- 合适的模型形成了一个形状整体,它明确描述了AFM实验.
- AFMfit成功地将每个分子与其构造状态联系起来.
- 对合成和实验AFM/HS-AFM数据的应用,包括激活因子V和TRPV3.
结论:
- AFMfit提供了一种高效,强大的方法来分析AFM数据中的单分子蛋白质动态.
- 该开源软件包促进了对形状组合的研究,并使大规模AFM数据集的分析成为可能.
- 这种方法增强了对结构生物学和生物物理学研究的AFM实验的解释.
相关概念视频
Atomic Force Microscopy
4.4K
Atomic force microscopy (AFM) is a type of scanning probe microscopy that can analyze topographic details of various specimens like ceramics, glass, polymers, and biological samples. AFM offers over 1000 times more resolution than the optical imaging system. Images generated from AFM are three-dimensional surface profiles, offering an advantage over the flat, two-dimensional images from other imaging techniques.
The AFM Probe
The probe is regarded as the heart of any AFM setup and comprises the...
The AFM Probe
The probe is regarded as the heart of any AFM setup and comprises the...
4.4K
¹H NMR of Conformationally Flexible Molecules: Temporal Resolution
1.3K
At room temperature, the chair conformer of cyclohexane undergoes rapid ring flipping between two equivalent chair conformers at a rate of approximately 105 times per second. These two chair conformers are in equilibrium. The rapid ring flipping results in the interconversion of the axial proton to an equatorial proton and an equatorial to the axial proton. Such interconversions are too rapid and cannot be detected on the NMR timescale. Hence, the NMR spectrometer cannot distinguish between the...
1.3K
Fast Fourier Transform
899
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...
899


