Algorithm, applications and evaluation for protein comparison by Ramanujan Fourier transform

Jian Zhao1, Jiasong Wang2, Wei Hua3

  • 1School of Science, Nanjing Tech University, Nanjing, 211816, China; College of Biotechnology and Pharmaceutical Engineering, Nanjing Tech University, Nanjing, 211816, China.

Related Concept Videos

Raman Spectroscopy: Overview01:20

Raman Spectroscopy: Overview

The underlying principle of Raman spectroscopy is based on the interaction between light and matter, specifically molecules' inelastic scattering of photons. When a monochromatic beam of light, typically from a laser source, interacts with a sample, most scattered light has the same frequency as the incident light. This is known as Rayleigh scattering.
However, a small fraction of the scattered light exhibits a frequency shift due to the exchange of energy between the incident photons and...
2.6K
Raman Spectroscopy Instrumentation: Overview01:26

Raman Spectroscopy Instrumentation: Overview

A conventional Raman spectrophotometer includes a laser source, a sample holding system, a wavelength selector, and a detector.
The monochromatic laser source, typically using visible or near-infrared radiation, generates a highly focused beam of light. This light interacts with the molecules of the sample, scattering some of the light. Liquid and gaseous samples are usually tested in ordinary glass capillaries, while solids can be analyzed as powders packed in capillaries or as potassium...
1.8K
Proteomics01:33

Proteomics

A proteome is the entire set of proteins that a cell type produces. We can study proteomes using the knowledge of genomes because genes code for mRNAs, and the mRNAs encode proteins. Although mRNA analysis is a step in the right direction, not all mRNAs are translated into proteins.
Proteomics is the study of proteomes' function. It involves the large-scale systematic study of the proteome to denote the protein complement expressed by a genome. Scientist Mark Wilkins coined the term...
10.2K
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...
1.2K