Computing the Burrows–Wheeler Transform in Place and in Small Space - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Discrete Algorithms Année : 2015

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

Résumé

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.
Fichier principal
Vignette du fichier
jda3.pdf (194.04 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01806295 , version 1 (01-06-2018)

Identifiants

  • HAL Id : hal-01806295 , version 1

Citer

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, 2015. ⟨hal-01806295⟩
33 Consultations
375 Téléchargements

Partager

Gmail Facebook X LinkedIn More