Paper Info
Title
Wheeler graphs: A framework for BWT-based data structures.
Abstract
The famous Burrows–Wheeler Transform (BWT) was originally defined for a single string but variations have been developed for sets of strings, labeled trees, de Bruijn graphs, etc. In this paper we propose a framework that includes many of these variations and that we hope will simplify the search for more.
Year
DOI
Venue
2017
10.1016/j.tcs.2017.06.016
Theoretical Computer Science
Keywords
Field
DocType
Compressed data structures,Burrows–Wheeler transform,Pattern matching
Graph,Data structure,Discrete mathematics,Combinatorics,Burrows–Wheeler transform,Automaton,State diagram,Coherence (physics),De Bruijn sequence,Pattern matching,Mathematics
Journal
Volume
ISSN
Citations 
698
0304-3975
11
PageRank 
References 
Authors
0.66
29
3
Name
Order
Citations
PageRank
Travis Gagie164363.61
Giovanni Manzini21584111.42
Jouni Sirén322214.85