Related Experiment Video
Updated: Apr 16, 2026

08:35
Application of DNA Fingerprinting using the D1S80 Locus in Lab Classes
Published on: July 17, 2021
23.8K
A new method to cluster DNA sequences using Fourier power spectrum.
Tung Hoang1, Changchuan Yin1, Hui Zheng1
1Department of Mathematics, Statistics and Computer Science, University of Ilinois at Chicago, Chicago, IL 60607, USA.
Journal of Theoretical Biology
|March 10, 2015
Summary
A new clustering method uses DNA sequence analysis and Discrete Fourier Transform to classify genes and genomes. This approach efficiently reveals evolutionary relationships, outperforming existing methods in speed and comparability.
Area of Science:
- Bioinformatics
- Computational Biology
- Genomics
Background:
- Accurate classification of genes and genomes is crucial for understanding evolutionary relationships.
- Existing methods for sequence comparison, such as multiple sequence alignment and alignment-free techniques, face challenges with sequence length variability and computational efficiency.
Purpose of the Study:
- To introduce a novel clustering method for classifying DNA sequences, genes, and genomes.
- To develop an efficient and accurate approach for determining evolutionary relationships between DNA sequences, regardless of length.
Main Methods:
- Constructing binary indicator sequences for each nucleotide in a DNA sequence.
- Applying Discrete Fourier Transform (DFT) to generate power spectra from these indicator sequences.
- Calculating mathematical moments from the power spectra to create multidimensional vectors for cluster analysis.
Main Results:
- The proposed method effectively classifies genes and genomes by analyzing evolutionary relationships.
- It demonstrates the ability to compare DNA sequences of varying lengths using power spectra and moments.
- Experimental results confirm the method's efficiency and comparable accuracy against established alignment-based and alignment-free techniques.
Conclusions:
- The novel clustering method offers an efficient and accurate tool for gene and genome classification.
- Its ability to handle sequences of different lengths and its speed make it a valuable advancement in bioinformatics.
- This approach provides a faster alternative to traditional methods for analyzing evolutionary relationships in DNA sequences.
Related Concept Videos
Discrete Fourier Transform
1.2K
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.2K
Cluster Sampling Method
15.8K
Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
15.8K
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
Sanger Sequencing
780.8K
DNA sequencing is a fundamental technique that is routinely used in the biological sciences. This method can be applied to a range of questions at different scales - from the sequencing of a cloned DNA fragment or the study of a mutation in a gene up to whole-genome sequencing. However, despite the widespread use of sequencing today, it was not until 1977 that Fredrick Sanger and his collaborators developed the chain-termination method to decode DNA sequences. It relies on the separation of a...
780.8K
Discrete-Time Fourier Series
888
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...
888
Basic signals of Fourier Transform
1.3K
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...
1.3K

