Wheeler graphs: A framework for BWT-based data structures / Travis Gagie; Giovanni Manzini; Jouni Sirén.

By: Contributor(s): Material type: ArticleLanguage: English Publisher: [Place of publication not identified] : Elsevier BV, 2017Description: 1 online resource (1 article)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
Subject(s): Genre/Form: In: Theoretical Computer Science Vol. 698, (2017), pages/article 67-78Abstract: 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. We first define Wheeler graphs and show they have a property we call path coherence. We show that if the state diagram of a finite-state automaton is a Wheeler graph then, by its path coherence, we can order the nodes such that, for any string, the nodes reachable from the initial state or states by processing that string are consecutive. This means that even if the automaton is non-deterministic, we can still store it compactly and process strings with it quickly. We then rederive several variations of the BWT by designing straightforward finite-state automata for the relevant problems and showing that their state diagrams are Wheeler graphs.
List(s) this item appears in: Open Access Resources
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

Publication type: Journal article.

Linked open-access copy: published version.

Open access; no subscription required for the linked open-access version. Unrestricted online access star

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. We first define Wheeler graphs and show they have a property we call path coherence. We show that if the state diagram of a finite-state automaton is a Wheeler graph then, by its path coherence, we can order the nodes such that, for any string, the nodes reachable from the initial state or states by processing that string are consecutive. This means that even if the automaton is non-deterministic, we can still store it compactly and process strings with it quickly. We then rederive several variations of the BWT by designing straightforward finite-state automata for the relevant problems and showing that their state diagrams are Wheeler graphs.

Creative Commons Attribution (licence family recorded by the source; version not supplied in metadata).

https://openalex.org/W2725379159

In English.

Description generated from OpenAlex bibliographic metadata retrieved on 5 October 2026; full text linked from the source.

Course allocation: B. Sc. Computer Science.

There are no comments on this title.

to post a comment.