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

Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

13.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...
13.5K
Sanger Sequencing01:57

Sanger Sequencing

777.6K
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...
777.6K
Compacting Factor test01:22

Compacting Factor test

676
The compacting factor test is a method used to assess the workability of concrete. It is  especially suitable for concrete mixes containing aggregates up to one and a half inches in size. This test involves specialized equipment consisting of two truncated cone-shaped hoppers and a cylinder, all with polished interior surfaces to minimize friction.
The procedure begins by placing concrete into the upper hopper without any compaction. Once filled, the bottom door of this hopper is opened,...
676
Next-generation Sequencing03:00

Next-generation Sequencing

100.7K
The first human genome sequencing project cost $2.7 billion and was declared complete in 2003, after 15 years of international cooperation and collaboration between several research teams and funding agencies. Today, with the advent of next-generation sequencing technologies, the cost and time of sequencing a human genome have dropped over 100 fold.
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features....
100.7K
Multi-species Conserved Sequences02:51

Multi-species Conserved Sequences

4.9K
Next-generation sequencing technologies have created large genomic databases of a variety of animals and plants. Ever since the human genome project was completed, scientists studied the genome of primates, mammals, and other phylogenetically distant living beings. Such large-scale  studies have provided new insights into the evolutionary relationship between organisms.
Although the genome of each species varies greatly from each other, a few sequences are highly conserved. Such conserved...
4.9K
Genomics02:02

Genomics

41.6K
Genomics is the science of genomes: it is the study of all the genetic material of an organism. In humans, the genome consists of information carried in 23 pairs of chromosomes in the nucleus, as well as mitochondrial DNA. In genomics, both coding and non-coding DNA is sequenced and analyzed. Genomics allows a better understanding of all living things, their evolution, and their diversity. It has a myriad of uses: for example, to build phylogenetic trees, to improve productivity and...
41.6K

You might also read

Related Articles

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

Sort by
Same author

The gift of novelty: repeat-robust k-mer-based estimators of mutation rates.

Bioinformatics (Oxford, England)·2026
Same author

A k-mer-based estimator of the substitution rate between repetitive sequences.

Algorithms for molecular biology : AMB·2026
Same author

A versatile multi-components mixed model for bacterial-Genome Wide association studies.

Nature communications·2026
Same author

Hash functions in nucleotide sequence analysis.

Genome research·2026
Same author

Estimation of substitution and indel rates via <i>k</i>-mer statistics.

Algorithms in bioinformatics : ... International Workshop, WABI ..., proceedings. WABI (Workshop)·2026
Same author

A k-mer-Based Estimator of the Substitution Rate Between Repetitive Sequences.

Algorithms in bioinformatics : ... International Workshop, WABI ..., proceedings. WABI (Workshop)·2026

Related Experiment Video

Updated: Mar 19, 2026

Author Spotlight: Investigating the Role of Repetitive DNA Misregulation in Cancer Initiation and Immunotherapy Resistance
04:58

Author Spotlight: Investigating the Role of Repetitive DNA Misregulation in Cancer Initiation and Immunotherapy Resistance

Published on: December 13, 2024

4.7K

Compacting de Bruijn graphs from sequencing data quickly and in low memory.

Rayan Chikhi1, Antoine Limasset2, Paul Medvedev3

  • 1CNRS, CRIStAL, Lille, France.

Bioinformatics (Oxford, England)
|June 17, 2016
PubMed
Summary
This summary is machine-generated.

The bcalm 2 tool significantly speeds up de Bruijn graph compaction, a critical step in DNA sequencing assembly. This new algorithm offers substantial improvements in computational efficiency and memory usage for large-scale sequencing projects.

More Related Videos

Hybrid De Novo Genome Assembly for the Generation of Complete Genomes of Urinary Bacteria using Short- and Long-read Sequencing Technologies
12:08

Hybrid De Novo Genome Assembly for the Generation of Complete Genomes of Urinary Bacteria using Short- and Long-read Sequencing Technologies

Published on: August 20, 2021

5.9K
Design and Synthesis of a Reconfigurable DNA Accordion Rack
07:44

Design and Synthesis of a Reconfigurable DNA Accordion Rack

Published on: August 15, 2018

7.6K

Related Experiment Videos

Last Updated: Mar 19, 2026

Author Spotlight: Investigating the Role of Repetitive DNA Misregulation in Cancer Initiation and Immunotherapy Resistance
04:58

Author Spotlight: Investigating the Role of Repetitive DNA Misregulation in Cancer Initiation and Immunotherapy Resistance

Published on: December 13, 2024

4.7K
Hybrid De Novo Genome Assembly for the Generation of Complete Genomes of Urinary Bacteria using Short- and Long-read Sequencing Technologies
12:08

Hybrid De Novo Genome Assembly for the Generation of Complete Genomes of Urinary Bacteria using Short- and Long-read Sequencing Technologies

Published on: August 20, 2021

5.9K
Design and Synthesis of a Reconfigurable DNA Accordion Rack
07:44

Design and Synthesis of a Reconfigurable DNA Accordion Rack

Published on: August 15, 2018

7.6K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Next-generation sequencing generates vast amounts of data, increasing computational demands for genome assembly.
  • De Bruijn graphs are essential data structures for fragment assembly, but their size poses computational challenges.
  • Graph compaction, a key data reduction step, has become a performance bottleneck in assembly pipelines.

Purpose of the Study:

  • To develop and present an efficient algorithm and tool for de Bruijn graph compaction.
  • To address the computational bottleneck in de Bruijn graph-based genome assembly.

Main Methods:

  • Developed bcalm 2, a parallel algorithm for de Bruijn graph compaction.
  • Utilized minimizer hashing for input distribution and balanced memory usage.
  • Applied the algorithm to human, loblolly pine, and white spruce sequencing datasets.

Main Results:

  • bcalm 2 significantly reduces the time and memory required for de Bruijn graph compaction.
  • For human sequencing data, compaction takes approximately one hour and 3 GB of memory.
  • Processed large datasets (22 Gbp and 20 Gbp) in under two days on a single machine.
  • Achieved at least an order of magnitude improvement over existing methods.

Conclusions:

  • bcalm 2 provides a highly efficient solution for de Bruijn graph compaction.
  • The tool effectively handles large-scale sequencing data, overcoming previous computational limitations.
  • Offers a substantial advancement for genome assembly pipelines.