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

Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Graphical Representation of Inequalities01:28

Graphical Representation of Inequalities

The graph of the equation where y equals x squared forms a curve known as a parabola. This curve acts as a boundary in the coordinate plane, dividing it into distinct regions based on the relative position of points.When the equality sign in the equation is replaced with an inequality—such as greater than, less than, greater than or equal to, or less than or equal to—the graphical representation changes from a single curve into a broader shaded area that signifies the set of all points...
Extended Versions of Green’s Theorem01:27

Extended Versions of Green’s Theorem

Green’s Theorem connects the circulation of a vector field around a closed curve with the behavior of the field across the region enclosed by that curve. It provides a way to replace a line integral around a boundary with a double integral over the interior region, making it especially useful in plane geometry, fluid flow, and vector calculus.Although Green’s Theorem is often introduced using simple regions without gaps, it can also be applied to regions made from several simple parts. This...
Graphs of Equations in Two Variables01:30

Graphs of Equations in Two Variables

An equation with two variables, typically written in the form y = f(x) or Ax + By = C, describes a relationship between quantities represented by x and y. Each solution to such an equation is an ordered pair (x, y) that satisfies the equation when substituted. These pairs can be represented graphically to understand the variables' relationship visually.A common technique for constructing the graph of a two-variable equation is to create a value table. Begin by choosing several values for the...
Types of Errors: Detection and Minimization01:12

Types of Errors: Detection and Minimization

Error is the deviation of the obtained result from the true, expected value or the estimated central value. Errors are expressed in absolute or relative terms.
Absolute error in a measurement is the numerical difference from the true or central value. Relative error is the ratio between absolute error and the true or central value, expressed as a percentage.
Errors can be classified by source, magnitude, and sign. There are three types of errors: systematic, random, and gross.
Systematic or...
Graphs of Two-Variable Functions01:27

Graphs of Two-Variable Functions

A weather map provides a practical example of a function of two variables. Across a wide region such as the United States, temperatures vary from one location to another. Each location can be identified by two geographic coordinates: longitude and latitude. Since a single temperature value is assigned to each coordinate pair, the situation can be represented mathematically as a function with two inputs and one output.In mathematical notation, longitude and latitude can be labeled as x and y,...

You might also read

Related Articles

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

Sort by
Same author

A complete human pancreatic cancer genome.

bioRxiv : the preprint server for biology·2026
Same author

Telomere-to-telomere assembly using HERRO-corrected Nanopore Simplex reads.

Nature·2026
Same author

A complete diploid human genome benchmark for personalized genomics.

bioRxiv : the preprint server for biology·2025
Same author

RiNALMo: general-purpose RNA language models can generalize well on structure prediction tasks.

Nature communications·2025
Same author

A systematic benchmark of Nanopore long-read RNA sequencing for transcript-level analysis in human cell lines.

Nature methods·2025
Same author

Detecting a wide range of epitranscriptomic modifications using a nanopore-sequencing-based computational approach with 1D score-clustering.

Nucleic acids research·2024
Same journal

OpenIMC: an open-source platform for analyzing single-cell and spatial proteomics by imaging mass cytometry.

BMC bioinformatics·2026
Same journal

NAP: an open source pipeline for cross-domain microbiome profiling using Nanopore sequencing-derived amplicon data.

BMC bioinformatics·2026
Same journal

SurvGME: an R package for survival analysis with graphical and measurement error models.

BMC bioinformatics·2026
Same journal

SimMapNet: a Bayesian framework for gene regulatory network inference using gene ontology similarities as external hint.

BMC bioinformatics·2026
Same journal

Dual channel drug-drug interactions extraction based on cross attention.

BMC bioinformatics·2026
Same journal

FeSseqdb: a curated sequence-level database and interpretable machine learning framework for identifying iron-sulfur proteins.

BMC bioinformatics·2026
See all related articles

Related Experiment Video

Updated: Jun 18, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

GnnDebugger: GNN based error correction in De Bruijn Graphs.

Marijo Šimunović1, Lovro Vrček2, Mile Šikić3,2

  • 1Faculty of Electrical Engineering and Computing, University of Zagreb, Zagreb, Croatia. marijo.simunovic@fer.hr.

BMC Bioinformatics
|June 17, 2026
PubMed
Summary
This summary is machine-generated.

We developed a machine learning method using graph neural networks to correct errors in De Bruijn Graphs for more accurate genome assembly. This approach improves diploid genome sequencing, even at lower coverage depths.

Keywords:
Error correctionGNNsGenome assemblyPacBio HiFide Bruijn Graph

More Related Videos

Quantitative Analysis of Climbing Defects in a Drosophila Model of Neurodegenerative Disorders
06:30

Quantitative Analysis of Climbing Defects in a Drosophila Model of Neurodegenerative Disorders

Published on: June 13, 2015

Related Experiment Videos

Last Updated: Jun 18, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

Quantitative Analysis of Climbing Defects in a Drosophila Model of Neurodegenerative Disorders
06:30

Quantitative Analysis of Climbing Defects in a Drosophila Model of Neurodegenerative Disorders

Published on: June 13, 2015

Area of Science:

  • Genomics
  • Bioinformatics
  • Machine Learning

Background:

  • High-throughput sequencing enables complete mammalian genome reconstruction, but scalability to diverse species and populations is limited.
  • Low-quality draft assemblies and high coverage requirements are key bottlenecks.
  • Accurate reconstruction of diploid genomes, especially diverged regions, is challenging due to insufficient sequencing depth.

Purpose of the Study:

  • To explore machine learning, specifically graph neural networks, for scalable error correction in De Bruijn Graphs.
  • To address limitations of existing heuristic methods in genome assembly.

Main Methods:

  • Developed a Graph Neural Network model for error correction in De Bruijn Graphs.
  • Applied the model to classify edges as correct or erroneous.

Main Results:

  • The Graph Neural Network model reliably classifies edges in De Bruijn Graphs, particularly for diploid genomes with coverage depth 35 or lower.
  • Model predictions can guide downstream read error correction and genome assembly algorithms.
  • Achieved more accurate genome assembly through guided error correction.

Conclusions:

  • Machine learning methods show potential to replace traditional heuristic approaches in genome assembly.
  • Learning-based methods can improve the performance of existing assemblers in difficult cases.
  • These approaches facilitate adaptation to newly sequenced species and population-level studies.