Wheeler graphs: a framework for BWT-based data structures
type: Item
instance of: scholarly article
title: Wheeler graphs: a framework for BWT-based data structures
zbMATH Open document ID: 1380.68145
author: Travis Gagie
author: Giovanni Manzini
author: Jouni Sirén
published in: Theoretical Computer Science
publication date: 2017-11-06T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6803098
zbMATH Keywords: compressed data structures
zbMATH Keywords: Burrows-Wheeler transform
zbMATH Keywords: pattern matching
describes a project that uses: MEGAHIT
describes a project that uses: BWA
describes a project that uses: Valgrind
MaRDI profile type: Publication
full work available at URL: j.tcs.2017.06.016
OpenAlex ID: W2725379159
Wikidata QID: Q47136623
cites work: Lightweight algorithms for constructing and inverting the BWT of string collections
cites work: Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
cites work: Bidirectional Variable-Order de Bruijn Graphs
cites work: Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis
cites work: Succinct de Bruijn Graphs
cites work: The myriad virtues of wavelet trees
cites work: Boosting textual compression in optimal linear time
cites work: Compressed text indexes
cites work: Compressing and indexing labeled trees, with applications
cites work: Indexing compressed text
cites work: The compressed permuterm index
cites work: An Encoding for Order-Preserving Matching.
cites work: New algorithms on wavelet trees and applications to information retrieval
cites work: pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems
cites work: A bijection between words and multisets of necklaces
cites work: Counting permutations with given cycle structure and descent set
cites work: Q4471381
cites work: Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
cites work: Succinct Indexes for Circular Patterns
cites work: Approximate string matching using a bidirectional index
cites work: Q2723961
cites work: Combinatorial Pattern Matching
cites work: An extension of the Burrows-Wheeler transform
cites work: An analysis of the Burrows—Wheeler transform
cites work: FM-index of alignment: a compressed index for similar strings
cites work: Compressed representations of sequences and full-text indexes
cites work: Indexing Variation Graphs
DBLP publication ID: journals/tcs/GagieMS17
DOI: 10.1016/J.TCS.2017.06.016
Recommended article: On relations between \(wp\)-graphs and data structures
Recommended article: Implementing Brouwer's database of strongly regular graphs
Recommended article: On the complexity of recognizing Wheeler graphs
Recommended article: Q5121627
Recommended article: Space efficient merging of de Bruijn graphs and Wheeler graphs
Recommended article: Succinct data structures for families of interval graphs
Recommended article: Q5091062
Recommended article: A hypergraph-based hierarchial data structure and its applications
description: scientific article; zbMATH DE number 6803098