A bijective variant of the Burrows–Wheeler Transform using V-order

In this paper we introduce the V-transform (V-BWT), a variant of the classic Burrows–Wheeler Transform. The original BWT uses lexicographic order, whereas we apply a distinct total ordering of strings called V-order. V-order string comparison and Lyndon-like factorization of a string x=x[1..n] into V-words have recently been shown to be linear in their use of time and space (Daykin et al., 2011) [18]. Here we apply these subcomputations, along …