Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Transformers with Off-Nominal Turns Ratios01:25

Transformers with Off-Nominal Turns Ratios

491
In scenarios involving parallel transformers with disparate ratings, developing per-unit models requires accommodating off-nominal turns ratios. This situation arises when the selected base voltages are not proportional to the transformer’s voltage ratings. Consider a transformer where the rated voltages are related by the term a. If the chosen voltage bases satisfy a relationship involving term b, term c is defined as the ratio of these bases. This ratio is then substituted into the...
491
Parseval's Theorem for Fourier transform01:15

Parseval's Theorem for Fourier transform

2.0K
Parseval's theorem is a fundamental principle in signal processing that enables the calculation of a signal's energy in either the time domain or the frequency domain. This theorem is pivotal in demonstrating energy conservation between these two domains, ensuring that the computed energy value remains consistent regardless of the domain of analysis.
To understand Parseval's theorem, it is essential to first comprehend how signal energy is typically calculated. When considering a...
2.0K
Transformers01:26

Transformers

1.7K
A device that transforms voltages from one value to another using induction is called a transformer. A transformer consists of two separate coils, or windings, wrapped around the same soft iron core. However, they are electrically insulated from each other.
The iron core has a substantial relative permeability. Therefore, the magnetic field lines generated due to the current in one winding are almost entirely confined within the core, such that the same magnetic flux permeates each turn of both...
1.7K
Parseval's Theorem01:18

Parseval's Theorem

1.0K
Parseval's theorem is a fundamental concept in signal processing and harmonic analysis. It asserts that for a periodic function, the average power of the signal over one period equals the sum of the squared magnitudes of all its complex Fourier coefficients. This theorem, named after Marc-Antoine Parseval, provides a powerful tool for analyzing the energy distribution in signals.
Interestingly, Parseval's theorem also holds for the trigonometric form of the Fourier series, which expresses a...
1.0K
Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

12.5K
In the same year as the discovery of the Sanger sequencing method, another group of scientists, Allan Maxam and Walter Gilbert, demonstrated their chemical-cleavage method for DNA sequencing. The Maxam-Gilbert method relies on using different chemicals that can cleave the DNA sequence at specific sites, the separation of resulting DNA fragments of variable size using electrophoresis, and deciphering the DNA sequence from the resulting gel bands.
Challenges of the Maxam-Gilbert Method
The...
12.5K
Mass Analyzers: Common Types01:19

Mass Analyzers: Common Types

1.3K
The quadrupole mass analyzer consists of four cylindrical metal rods arranged in a diamond carrying a DC voltage and a radio-frequency AC voltage. The motion of ions through the quadrupole depends on the field strength, causing only ions of a certain m/z to resonate successfully and strike the detector at a given field strength. Though the transmission rate for these analyzers is high, the exact elemental composition of the sample is not determined because of low resolution; however, they are...
1.3K

You might also read

Related Articles

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

Sort by
Same author

Sarand: exploring antimicrobial resistance gene neighbourhoods in complex metagenomic assembly graphs.

NAR genomics and bioinformatics·2026
Same author

RLBWT-based LCP computation in compressed space for terabase-scale pangenome analysis.

Bioinformatics (Oxford, England)·2026
Same author

Movi Color: fast and accurate taxonomic classification with the move structure.

ACM-BCB ... ... : the ... ACM Conference on Bioinformatics, Computational Biology and Biomedicine. ACM Conference on Bioinformatics, Computational Biology and Biomedicine·2026
Same author

Faster run-length compressed suffix arrays.

Oasics : openaccess series in informatics·2026
Same author

Minimizing reference bias with an imputed personalized reference.

Genome research·2026
Same author

RLBWT-Based LCP Computation in Compressed Space for Terabase-Scale Pangenome Analysis.

bioRxiv : the preprint server for biology·2026

Related Experiment Video

Updated: Jan 8, 2026

Worm-align and Worm_CP, Two Open-Source Pipelines for Straightening and Quantification of Fluorescence Image Data Obtained from Caenorhabditis elegans
11:16

Worm-align and Worm_CP, Two Open-Source Pipelines for Straightening and Quantification of Fluorescence Image Data Obtained from Caenorhabditis elegans

Published on: May 28, 2020

6.6K

Prefix-free parsing for merging big BWTs.

Diego Díaz-Domínguez1, Travis Gagie2, Veronica Guerrini3

  • 1University of Helsinki, Finland.

International Symposium on String Processing and Information Retrieval : SPIRE ... : Proceedings. SPIRE (Symposium)
|December 15, 2025
PubMed
Summary

Building large Burrows-Wheeler Transforms (BWTs) using prefix-free parsing (PFP) is memory-intensive. This study presents a method to merge smaller BWTs, significantly reducing memory usage for large, fragmented datasets.

Keywords:
Burrows-Wheeler TransformLow-memory algorithmsPangenomicsPrefix-free parsing

More Related Videos

Author Spotlight: Optimizing Hairy Root-Based Transformation Protocols for Enhanced Efficiency in Brassicaceae
08:52

Author Spotlight: Optimizing Hairy Root-Based Transformation Protocols for Enhanced Efficiency in Brassicaceae

Published on: December 22, 2023

4.9K
Automating Aggregate Quantification in Caenorhabditis elegans
07:50

Automating Aggregate Quantification in Caenorhabditis elegans

Published on: October 14, 2021

3.2K

Related Experiment Videos

Last Updated: Jan 8, 2026

Worm-align and Worm_CP, Two Open-Source Pipelines for Straightening and Quantification of Fluorescence Image Data Obtained from Caenorhabditis elegans
11:16

Worm-align and Worm_CP, Two Open-Source Pipelines for Straightening and Quantification of Fluorescence Image Data Obtained from Caenorhabditis elegans

Published on: May 28, 2020

6.6K
Author Spotlight: Optimizing Hairy Root-Based Transformation Protocols for Enhanced Efficiency in Brassicaceae
08:52

Author Spotlight: Optimizing Hairy Root-Based Transformation Protocols for Enhanced Efficiency in Brassicaceae

Published on: December 22, 2023

4.9K
Automating Aggregate Quantification in Caenorhabditis elegans
07:50

Automating Aggregate Quantification in Caenorhabditis elegans

Published on: October 14, 2021

3.2K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Data Compression

Background:

  • Prefix-free parsing (PFP) is essential for constructing Burrows-Wheeler Transforms (BWTs) of large datasets.
  • Standard PFP methods require substantial memory, posing challenges for extremely large datasets.

Purpose of the Study:

  • To develop a memory-efficient approach for building BWTs of massive datasets.
  • To address the high memory footprint of PFP in bioinformatics applications.

Main Methods:

  • Decomposition of large datasets into smaller, dissimilar subsets.
  • Independent construction of BWTs for each subset.
  • Merging of individual BWTs to form the complete dataset's BWT.

Main Results:

  • Demonstrated significant reduction in memory requirements for PFP.
  • Successfully applied the method to datasets with biological relevance (e.g., genomic collections).
  • The merging strategy proved effective for large-scale BWT construction.

Conclusions:

  • The proposed method offers a practical solution for memory-intensive BWT construction.
  • This approach is particularly beneficial for fragmented biological datasets.
  • Efficient BWT generation is crucial for advancing large-scale genomic data analysis.