Related Experiment Video
Updated: May 5, 2026

14:09
Localization and Relative Quantification of Carbon Nanotubes in Cells with Multispectral Imaging Flow Cytometry
Published on: December 12, 2013
6.1K
scFTAT: a novel cell annotation method integrating FFT and transformer.
Binhua Tang1,2,3, Yiyao Chen4,5
1College of Information Science and Engineering, Hohai University, Jiangsu, 213200, China. bh.tang@hhu.edu.cn.
BMC Bioinformatics
|February 24, 2025
Summary
We developed scFTAT, a novel single-cell RNA annotation model using Fast Fourier Transform (FFT) and an enhanced Transformer. It effectively reduces data sparsity and automates cell annotation, outperforming existing tools in accuracy and robustness.
Area of Science:
- Computational Biology
- Genomics
- Bioinformatics
Background:
- Single-cell RNA sequencing (scRNA-seq) studies are advancing rapidly.
- Current annotation methods struggle with high data sparsity and manual effort.
- Automating cell annotation is crucial for large-scale scRNA-seq data analysis.
Purpose of the Study:
- To develop a novel model for automatic single-cell data annotation.
- To address challenges of data sparsity and manual annotation in scRNA-seq.
- To improve the accuracy and efficiency of cell type identification.
Main Methods:
- Proposed scFTAT model integrating Fast Fourier Transform (FFT) and an enhanced Transformer.
- Utilized Linear Discriminant Analysis (LDA) to reduce data sparsity.
- Incorporated kernel approximation, position encoding enhancement, and attention enhancement for fine-tuning.
Main Results:
- scFTAT achieved high accuracy and robustness on six typical scRNA-seq datasets.
- Demonstrated superior performance compared to existing annotation tools.
- Achieved 0.93 accuracy and 0.89 MCC on human kidney data, outperforming others (0.92 accuracy, 0.85 MCC).
Conclusions:
- scFTAT effectively integrates FFT and enhanced Transformer for automatic feature learning.
- The model successfully addresses sparsity and manual annotation challenges in scRNA-seq.
- Experimental results validate the efficiency and robustness of scFTAT for scRNA-seq data analysis.
More Related Videos
Related Concept Videos
Discrete Fourier Transform
1.3K
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...
1.3K
Fast Fourier Transform
1.3K
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...
1.3K

