Buffering updates enables efficient dynamic de Bruijn graphs
Motivation: The de Bruijn graph has become a ubiquitous graph model for biological data ever since its initial introduction in the late 1990s. It has been used for a variety of purposes including genome assembly (Zerbino and Birney, 2008; Bankevich et al., 2012; Peng et al., 2012), variant detection...
Main Authors: | Jarno Alanko, Bahar Alipanahi, Jonathen Settle, Christina Boucher, Travis Gagie |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2021-01-01
|
Series: | Computational and Structural Biotechnology Journal |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2001037021002853 |
Similar Items
-
External memory BWT and LCP computation for sequence collections with applications
by: Lavinia Egidi, et al.
Published: (2019-03-01) -
Dynamic construction of pan-genome subgraphs
by: Dede Kadir, et al.
Published: (2020-04-01) -
Higher Compression from the Burrows-Wheeler Transform with New Algorithms for the List Update Problem
by: Chapin, Brenton
Published: (2001) -
ANALISIS ALGORITMA MTF, MTF-1 DAN MTF-2 PADA BURROWS WHEELER COMPRESSION ALGORITHM
by: Sagara Mahardika Sunaryo, et al.
Published: (2019-07-01) -
Succinct Indexes
by: He, Meng
Published: (2008)