Computing the Burrows–Wheeler transform in place and in small space - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Discrete Algorithms Year : 2015

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(n2)$ 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 memory cells are allowed with σk distinct characters, providing an $O((n2/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ϵ−1log⁡n)$ time using just ϵn extra bytes.
Fichier principal
Vignette du fichier
crochemore2015.pdf (288.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01248855 , version 1 (29-06-2017)

Identifiers

Cite

Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau. Computing the Burrows–Wheeler transform in place and in small space. Journal of Discrete Algorithms, 2015, 32, pp.44-52. ⟨10.1016/j.jda.2015.01.004⟩. ⟨hal-01248855⟩
190 View
796 Download

Altmetric

Share

Gmail Facebook X LinkedIn More