Deciphering conformational dynamics in AFM data using fast nonlinear NMA and FFT-based search with AFMFit

Rémi Vuillemot1, Jean-Luc Pellequer2, Sergei Grudinin3

  • 1Univ. Grenoble Alpes, CNRS, Grenoble INP, LJK, Grenoble, France.

Communications Biology
|September 29, 2025
PubMed
Summary

AFMfit analyzes protein conformational dynamics from Atomic Force Microscopy (AFM) data. This new method efficiently interprets 2D AFM images to reveal 3D protein movements at the single-molecule level.

Related Concept Videos

Atomic Force Microscopy01:08

Atomic Force Microscopy

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...
4.4K
¹H NMR of Conformationally Flexible Molecules: Temporal Resolution00:52

¹H NMR of Conformationally Flexible Molecules: Temporal Resolution

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 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...
899