Space-Efficient Construction of Compressed Suffix Trees

08/12/2019
by   Nicola Prezza, et al.
0

We show how to build several data structures of central importance to string processing, taking as input the Burrows-Wheeler transform (BWT) and using small extra working space. Let n be the text length and σ be the alphabet size. We first provide two algorithms that enumerate all LCP values and suffix tree intervals in O(nσ) time using just o(nσ) bits of working space on top of the input BWT. Using these algorithms as building blocks, for any parameter 0 < ϵ≤ 1 we show how to build the PLCP bitvector and the balanced parentheses representation of the suffix tree topology in O(n(σ + ϵ^-1· n)) time using at most nσ·(ϵ + o(1)) bits of working space on top of the input BWT and the output. In particular, this implies that we can build a compressed suffix tree from the BWT using just succinct working space (i.e. o(nσ) bits) and any time in Θ(nσ) + ω(n n). This improves the previous most space-efficient algorithms, which worked in O(n) bits and O(n n) time. We also consider the problem of merging BWTs of string collections, and provide a solution running in O(nσ) time and using just o(nσ) bits of working space. An efficient implementation of our LCP construction and BWT merge algorithms use (in RAM) as few as n bits on top of a packed representation of the input/output and process data as fast as 2.92 megabases per second.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/16/2019

Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform

We show that the Longest Common Prefix Array of a text collection of tot...
research
12/13/2017

Closing in on Time and Space Optimal Construction of Compressed Indexes

Fast and space-efficient construction of compressed indexes such as comp...
research
02/28/2018

Fast Lempel-Ziv Decompression in Linear Space

We consider the problem of decompressing the Lempel-Ziv 77 representatio...
research
03/04/2019

Lightweight merging of compressed indices based on BWT variants

In this paper we propose a flexible and lightweight technique for mergin...
research
02/14/2019

Conversion from RLBWT to LZ77

Converting a compressed format of a string into another compressed forma...
research
10/16/2018

Nearly Optimal Space Efficient Algorithm for Depth First Search

We design a space-efficient algorithm for performing depth-first search ...
research
06/19/2019

Space Efficient Algorithms for Breadth-Depth Search

Continuing the recent trend, in this article we design several space-eff...

Please sign up or login with your details

Forgot password? Click here to reset