7 citations · 23 across the 12 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
On the Complexity of BWT-runs Minimization via Alphabet Reordering
Jason Bentley, Daniel Gibney, Sharma V. Thankachan
The Burrows-Wheeler Transform (BWT) has been an essential tool in text compression and indexing. First introduced in 1994, it went on to provide the backbone for the first encoding…
cs.CC2019
On the Hardness and Inapproximability of Recognizing Wheeler Graphs
Daniel Gibney, Sharma V. Thankachan
In recent years several compressed indexes based on variants of the Burrows-Wheeler transformation have been introduced. Some of these index structures far more complex than a sing…