Skip to Main content Skip to Navigation
Journal articles

Computing the Burrows–Wheeler Transform in Place and in Small Space

Abstract : We introduce the problem of computing the Burrows–Wheeler Transform (BWT) using small additional space. Our in-place algorithm does not need the explicit storage for the suffix sort array and the output array, as typically required in previous work. It relies on the combinatorial properties of the BWT, and runs in O(n 2) time in the comparison model using O(1) extra memory cells, apart from the array of n cells storing the n characters of the input text. We then discuss the time-space trade-off when O(k · σ k) extra ✩ A preliminary version of the results in this paper appeared in [6]. memory cells are allowed with σ k distinct characters, providing an O((n 2 /k + n) log k)-time algorithm to obtain (and invert) the BWT. For example in real systems where the alphabet size is a constant, for any arbitrarily small ǫ > 0, the BWT of a text of n bytes can be computed in O(nǫ −1 log n) time using just ǫn extra bytes.
Document type :
Journal articles
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Maxime Crochemore Connect in order to contact the contributor
Submitted on : Friday, June 1, 2018 - 7:06:55 PM
Last modification on : Thursday, September 29, 2022 - 2:21:15 PM
Long-term archiving on: : Sunday, September 2, 2018 - 4:12:19 PM


Files produced by the author(s)


  • HAL Id : hal-01806295, version 1



Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad Landau. Computing the Burrows–Wheeler Transform in Place and in Small Space. Journal of Discrete Algorithms, Elsevier, 2015. ⟨hal-01806295⟩



Record views


Files downloads