Space efficient merging of de Bruijn graphs and Wheeler graphs
type: Item
instance of: scholarly article
title: Space efficient merging of de Bruijn graphs and Wheeler graphs
author: Lavinia Egidi
author: Felipe A. Louza
author: Giovanni Manzini
published in: Algorithmica
publication date: 2022-03-22T00:00:00Z
full work available at URL: https://arxiv.org/abs/2009.03675
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7495490
zbMATH Keywords: succinct data structures
zbMATH Keywords: de Bruijn graphs
zbMATH Keywords: Wheeler graphs
zbMATH Keywords: BWT variants
zbMATH Keywords: space efficient algorithms
describes a project that uses: Rainbowfish
describes a project that uses: BWA
describes a project that uses: SplitMEM
MaRDI profile type: Publication
OpenAlex ID: W3183732978
cites work: Regular Languages meet Prefix Sorting
cites work: Recoloring the colored de Bruijn graph
cites work: Rainbowfish: A Succinct Colored de Bruijn Graph Representation
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
cites work: Optimal Lower and Upper Bounds for Representing Sequences
cites work: Q5088898
cites work: Bidirectional Variable-Order de Bruijn Graphs
cites work: Succinct de Bruijn Graphs
cites work: Q5090335
cites work: Lightweight BWT and LCP Merging via the Gap Algorithm
cites work: Lightweight merging of compressed indices based on BWT variants
cites work: Lightweight Data Indexing and Compression in External Memory
cites work: Indexing compressed text
cites work: Compressed representations of sequences and full-text indexes
cites work: Compressing and indexing labeled trees, with applications
cites work: The compressed permuterm index
cites work: Q6133881
cites work: Wheeler graphs: a framework for BWT-based data structures
cites work: On the Hardness and Inapproximability of Recognizing Wheeler Graphs
cites work: Engineering a lightweight external memory suffix array construction algorithm
cites work: An extension of the Burrows-Wheeler transform
cites work: FM-index of alignment with gaps
cites work: An Eulerian path approach to DNA fragment assembly
cites work: Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
cites work: Indexing Variation Graphs
DOI: 10.1007/S00453-021-00855-2
description: scientific article; zbMATH DE number 7495490