Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Fast Fourier Transform

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

MALDI-TOF Mass Spectrometry

MALDI-TOF Mass Spectrometry

Mass spectrometry is a powerful characterization technique that can identify and separate a wide variety of compounds ranging from chemical to biological entities, based on their mass-to-charge ratio (m/z). The instruments that allow this detection, known as mass spectrometers, have three components: an ion source, a mass analyzer, and a detector. These spectrometers differ based on the nature of their ion source and analyzers.Matrix-assisted laser desorption ionization (MALDI) is a commonly...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Extracting and Classifying Drug Discontinuations From Estonian Electronic Health Records: Development and Validation Study.

Journal of medical Internet research·2026

Same author

Globodera pallida virulence on major potato resistance has a common genetic basis across Western Europe.

PLoS pathogens·2026

Same author

Dynamics of genetic and somatic trade-offs in ageing and mortality.

Nature·2026

Same author

Stationary phloem proteins and their effects on viruses, aphids, and cyst nematodes in Arabidopsis.

Journal of plant physiology·2026

Same author

Systematic evaluation of medication adherence determinants across 137 active substances on population-level real-world health data.

Communications medicine·2026

Same author

Adaptive Tracepoints for Pangenome Alignment Compression.

bioRxiv : the preprint server for biology·2026

Same journal

Chromosomal scale genome assembly of medicinal plant Sophora tonkinensis.

BMC genomics·2026

Same journal

Variant-specific RNA testing resolves variants of uncertain significance in exome testing.

BMC genomics·2026

Same journal

Kaiso overexpression promotes an interferon immune response in murine intestines.

BMC genomics·2026

Same journal

Genomic evidence of ecological flexibility and cross-niche CRISPR spacerome targeting phage-plasmid hybrids in Latilactobacillus curvatus.

BMC genomics·2026

Same journal

Fgf evolution in vertebrates: insights from cyclostomes.

BMC genomics·2026

Same journal

Metabolic reprogramming, oxidative stress, and mitophagy in JSRV Env-transformed BEAS-2B cells: insights from integrated transcriptomics and metabolomics.

BMC genomics·2026

See all related articles

Search research articles

Related Experiment Video

Updated: May 13, 2026

Chromatographic Fingerprinting by Template Matching for Data Collected by Comprehensive Two-Dimensional Gas Chromatography

Chromatographic Fingerprinting by Template Matching for Data Collected by Comprehensive Two-Dimensional Gas Chromatography

Published on: September 2, 2020

Fast probabilistic file fingerprinting for big data.

Konstantin Tretyakov¹, Sven Laur, Geert Smant

¹Institute of Computer Science, University of Tartu, J, Liivi 2, 50409 Tartu, Estonia. Konstantin.Tretjakov@ut.ee

|March 1, 2013

Summary

This summary is machine-generated.

This study introduces Probabilistic Fast File Fingerprinting (PFFF), an efficient method for identifying unique large scientific data files. PFFF reduces computational load and speeds up data handling by sampling files instead of reading them fully.

Related Experiment Videos

Last Updated: May 13, 2026

Chromatographic Fingerprinting by Template Matching for Data Collected by Comprehensive Two-Dimensional Gas Chromatography

Chromatographic Fingerprinting by Template Matching for Data Collected by Comprehensive Two-Dimensional Gas Chromatography

Published on: September 2, 2020

Area of Science:

Bioinformatics
Computational Biology
Data Science

Background:

Biological data generation poses challenges in analysis and handling due to large file sizes.
Slow data transfer and analysis hinder efficient research workflows.
Common file operations like comparison and transfer are computationally expensive.

Purpose of the Study:

To develop an efficient method for calculating file uniqueness for large scientific data files.
To reduce the computational effort required for data analysis and handling.
To improve the speed of file-related workflows in data centers and for individual analysis.

Main Methods:

Probabilistic Fast File Fingerprinting (PFFF) method is presented.
File fingerprints are computed by random sampling, not full file reads.
Algorithm performance is evaluated across various data storage and access technologies.

Main Results:

PFFF is more computationally efficient than existing techniques.
Probabilistic fingerprinting achieves reliability comparable to traditional hashing with negligible collision risk.
Performance is correlated with data variation, not file size, offering a flat performance characteristic.

Conclusions:

Probabilistic fingerprinting significantly reduces computational resource usage for large file comparisons.
PFFF enhances the speed of data center and workbench file workflows.
An open-source tool named pfff (command-line and C library) is available.