# Tunneling on Wheeler Graphs

arXiv: https://arxiv.org/abs/1811.02457 · HTML: https://mlsanity.com/paper/1811.02457/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 6 Nov 2018.

## Built on by (most cited first, 1 of 1)

- [On (co-lex) Ordering Automata](https://mlsanity.com/paper/2106.02309/) (2021)

## Abstract (arXiv)

The Burrows-Wheeler Transform (BWT) is an important technique both in data compression and in the design of compact indexing data structures. It has been generalized from single strings to collections of strings and some classes of labeled directed graphs, such as tries and de Bruijn graphs. The BWTs of repetitive datasets are often compressible using run-length compression, but recently Baier (CPM 2018) described how they could be even further compressed using an idea he called tunneling. In this paper we show that tunneled BWTs can still be used for indexing and extend tunneling to the BWTs of Wheeler graphs, a framework that includes all the generalizations mentioned above.