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

Ogive Graph01:07

Ogive Graph

6.8K
An ogive graph is sometimes called a cumulative frequency polygon. It is one type of frequency polygon that shows cumulative frequency. In other words, the cumulative percentages are added to the graph from left to right. An ogive graph plots cumulative frequency on the vertical y-axis and class boundaries along the horizontal x-axis. It’s very similar to a histogram; only instead of rectangles, an ogive displays a single point where the top right of the rectangle would be. Creating this...
6.8K
Graphing Antiderivatives01:30

Graphing Antiderivatives

76
The concept of an antiderivative is fundamental in calculus, describing how a function's values accumulate over time. This process is closely related to physical motion, such as the movement of a rolling ball. As the ball progresses, its position changes in response to variations in velocity, just as an antiderivative graph reflects the cumulative effect of the original function's values.Graphing an antiderivative requires interpreting how a function's values influence the shape of its...
76
Bar Graph01:07

Bar Graph

23.0K
A bar graph is also called a bar chart and consists of bars that are separated from each other. It either uses horizontal or vertical bars to show comparisons among categories. The bars can be rectangles, or they can be rectangular boxes (used in three-dimensional plots). One axis of the graph represents the specific categories being compared, and the other axis shows a discrete value. In this graph, the length of the bar for each category is proportional to the number or percent of individuals...
23.0K
Graphs of Functions01:30

Graphs of Functions

351
Graphs of functions provide a visual representation of how output values change in response to varying inputs. Each point on the graph corresponds to an ordered pair, where the x-coordinate (independent variable) determines the horizontal position and the y-coordinate (dependent variable) determines the vertical position. Linear functions like y = x give a straight line, indicating a constant rate of change.Nonlinear functions display more complex behaviors. Even power functions generate...
351
Time-Series Graph00:54

Time-Series Graph

5.2K
A time-series graph is a line graph with repeated measurements taken at successive intervals of time. It is also called a time series chart. To construct a time-series graph, one must look at both pieces of a paired data set. The horizontal axis is used to plot the time increments, and the vertical axis is used to plot the values of the variable that one is measuring. By using the axes in this way, each point on the graph will correspond to time and a measured quantity. The points on the graph...
5.2K
Multiple Bar Graph01:07

Multiple Bar Graph

10.1K
As the name suggests, a multiple bar graph is the same as a bar graph but has multiple bars to depict relationships between different data values. One can include as many parameters as possible. However, each parameter must have the same unit of measurement.
Each bar or column in the multiple bar graph represents a data value. These graphs are used primarily in interrelating two or more sets of data. The categories of different kinds of data are listed along the horizontal or x-axis, whereas...
10.1K

You might also read

Related Articles

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

Sort by
Same author

Primer Design through Submodular Function Estimation.

Bioinformatics (Oxford, England)·2026
Same author

Accelerating String Comparison in RLZ Compressed Sequences via LCE Jumps.

bioRxiv : the preprint server for biology·2026
Same author

Movi 2: Fast and Space-Efficient Queries on Pangenomes.

Bioinformatics (Oxford, England)·2026
Same author

Building genomic data structures from compressed representations using prefix-free parsing.

Genome research·2026
Same author

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

Nature communications·2026
Same author

Faster run-length compressed suffix arrays.

Oasics : openaccess series in informatics·2026
Same journal

3DICE: Interpretable 3D Cross-Modal Learning for Drug-Target Interaction Prediction and Large-Scale Drug Discovery.

Bioinformatics (Oxford, England)·2026
Same journal

KASSPer: Kinase Active Site Structure Prediction using Protein and Ligand Language Models and Its Application to Virtual Screening.

Bioinformatics (Oxford, England)·2026
Same journal

IDR searcher: a search engine solution for public image resources.

Bioinformatics (Oxford, England)·2026
Same journal

KCFtools: Rapid alignment-free method for introgression screening and GWAS using k-mer profiles.

Bioinformatics (Oxford, England)·2026
Same journal

Meta2DB: Curated shotgun metagenomic feature sets and metadata for health state prediction.

Bioinformatics (Oxford, England)·2026
Same journal

conMItion: an R package adjusting confounding factors for associations in multi-omics.

Bioinformatics (Oxford, England)·2026
See all related articles

Related Experiment Video

Updated: Feb 8, 2026

Author Spotlight: Streamlining Visual Dynamics to Simplify Molecular Dynamics Simulations Using Gromacs
05:00

Author Spotlight: Streamlining Visual Dynamics to Simplify Molecular Dynamics Simulations Using Gromacs

Published on: August 9, 2024

1.9K

Practical dynamic de Bruijn graphs.

Victoria G Crawford1, Alan Kuhnle1, Christina Boucher1

  • 1Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL, USA.

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

This study presents a dynamic de Bruijn graph implementation for DNA sequencing data analysis. It efficiently supports node and edge deletions, crucial for refining assembly accuracy.

More Related Videos

Analyzing Melts and Fluids from Ab Initio Molecular Dynamics Simulations with the UMD Package
06:37

Analyzing Melts and Fluids from Ab Initio Molecular Dynamics Simulations with the UMD Package

Published on: September 17, 2021

5.1K
A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

36.1K

Related Experiment Videos

Last Updated: Feb 8, 2026

Author Spotlight: Streamlining Visual Dynamics to Simplify Molecular Dynamics Simulations Using Gromacs
05:00

Author Spotlight: Streamlining Visual Dynamics to Simplify Molecular Dynamics Simulations Using Gromacs

Published on: August 9, 2024

1.9K
Analyzing Melts and Fluids from Ab Initio Molecular Dynamics Simulations with the UMD Package
06:37

Analyzing Melts and Fluids from Ab Initio Molecular Dynamics Simulations with the UMD Package

Published on: September 17, 2021

5.1K
A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

36.1K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • De Bruijn graphs are essential for analyzing next-generation sequencing (NGS) data.
  • Rapidly growing DNA read datasets necessitate compact graph representations for efficient assembly.
  • Existing compact de Bruijn graph implementations lack dynamic node and edge deletion capabilities, hindering spurious element pruning.

Purpose of the Study:

  • To provide a practical implementation of a compact and fully dynamic de Bruijn graph data structure.
  • To support exact membership queries and dynamic edge operations.
  • To offer limited support for dynamic node operations, enabling graph pruning.

Main Methods:

  • Implementation of a data structure based on Belazzougui et al. (2016b).
  • Focus on exact membership queries and fully dynamic edge operations.
  • Inclusion of limited dynamic node operations for graph refinement.

Main Results:

  • The implemented data structure supports exact membership queries and dynamic edge operations.
  • Limited dynamic node operations are also supported for graph pruning.
  • Experimental performance is comparable to state-of-the-art Bloom filter-based implementations.

Conclusions:

  • The developed dynamic de Bruijn graph implementation offers efficient and flexible graph manipulation.
  • This advancement is critical for handling large-scale DNA sequencing datasets and improving assembly accuracy.
  • The open-source code facilitates further research and application in bioinformatics.