DeepAI AI Chat
Log In Sign Up

In-Place Bijective Burrows-Wheeler Transforms

by   Dominik Köppl, et al.
Tohoku University

One of the most well-known variants of the Burrows-Wheeler transform (BWT) [Burrows and Wheeler, 1994] is the bijective BWT (BBWT) [Gil and Scott, arXiv 2012], which applies the extended BWT (EBWT) [Mantaci et al., TCS 2007] to the multiset of Lyndon factors of a given text. Since the EBWT is invertible, the BBWT is a bijective transform in the sense that the inverse image of the EBWT restores this multiset of Lyndon factors such that the original text can be obtained by sorting these factors in non-increasing order. In this paper, we present algorithms constructing or inverting the BBWT in-place using quadratic time. We also present conversions from the BBWT to the BWT, or vice versa, either (a) in-place using quadratic time, or (b) in the run-length compressed setting using O(n r / r) time with O(r n) bits of words, where r is the sum of character runs in the BWT and the BBWT.


page 1

page 2

page 3

page 4


Efficient Representation and Counting of Antipower Factors in Words

A k-antipower (for k > 2) is a concatenation of k pairwise distinct word...

Strictly In-Place Algorithms for Permuting and Inverting Permutations

We revisit the problem of permuting an array of length n according to a ...

Resolution of the Burrows-Wheeler Transform Conjecture

Burrows-Wheeler Transform (BWT) is an invertible text transformation tha...

Exceptional designs in some extended quadratic residue codes

In the present paper, we give proofs of the existence of a 3-design in t...

MONI can find k-MEMs

Maximal exact matches (MEMs) have been widely used in bioinformatics at ...

Local Decodability of the Burrows-Wheeler Transform

The Burrows-Wheeler Transform (BWT) is among the most influential discov...

RLBWT Tricks

Experts would probably have guessed that compressed sparse bitvectors we...