Related Experiment Video
Updated: Nov 10, 2025
08:52
Author Spotlight: Optimizing Hairy Root-Based Transformation Protocols for Enhanced Efficiency in Brassicaceae
Published on: December 22, 2023
4.4K
Simplitigs as an efficient and scalable representation of de Bruijn graphs
Karel Břinda1,2, Michael Baym3, Gregory Kucherov4,5
1Department of Biomedical Informatics and Laboratory of Systems Pharmacology, Harvard Medical School, Boston, USA and Broad Institute of MIT and Harvard, Cambridge, USA. karel.brinda@hms.harvard.edu.
Genome Biology
|April 7, 2021
Summary
We introduce simplitigs, a novel, scalable representation for de Bruijn graphs in bioinformatics. Simplitigs significantly improve sequence assembly and reduce computational resource usage compared to existing methods.
Area of Science:
- Bioinformatics
- Computational Biology
- Genomics
Background:
- De Bruijn graphs are crucial in bioinformatics for sequence assembly.
- Current de Bruijn graph representations lack universal scalability.
- Existing methods face challenges with large-scale genomic datasets.
Purpose of the Study:
- Introduce simplitigs as a compact, efficient, and scalable de Bruijn graph representation.
- Present ProphAsm, a fast algorithm for computing simplitigs.
- Evaluate simplitigs against unitigs for sequence assembly performance.
Main Methods:
- Developed the simplitig representation and the ProphAsm algorithm.
- Compared simplitigs and unitigs using model organisms and bacterial pan-genomes.
- Integrated simplitigs with the Burrows-Wheeler Transform index.
Main Results:
- Simplitigs offer substantial improvements in cumulative sequence length and number compared to unitigs.
- ProphAsm efficiently computes simplitigs.
- Using simplitigs with the Burrows-Wheeler Transform index reduces memory and improves index loading and query times.
Conclusions:
- Simplitigs provide a superior, scalable representation for de Bruijn graphs in bioinformatics.
- The ProphAsm algorithm enables efficient computation of simplitigs.
- Simplitigs enhance the performance of sequence assembly and indexing for large-scale genomic data.
Related Concept Videos
01:28Graphical Representation of Inequalities
48
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...
48
01:10Vector Algebra: Graphical Method
15.9K
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...
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...
15.9K
01:22Block Diagram Reduction
369
The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
369
01:28Synthetic Disvision of Polynomials
30
Synthetic division is an efficient algorithmic approach for dividing a polynomial by a linear binomial of the form x - c, where c is a real number. This method is helpful due to its streamlined process, which avoids the more cumbersome steps involved in the traditional long division of polynomials. It simplifies computation and serves as a practical tool for evaluating polynomials and identifying their factors.To perform synthetic division, one begins by listing the coefficients of the...
30
01:26Singularity Functions for Shear
268
In structural analysis, singularity functions are crucial in simplifying the representation of shear forces in beams under discontinuous loading. These functions describe discontinuous variations in shear force across a beam with varying loads by using a single mathematical expression, regardless of the complexity of the loading conditions. The singularity functions are derived from creating a free-body diagram of the beam and then making conceptual cuts at specific points to examine the...
268
01:30Graphs of Equations in Two Variables
54
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...
54