Learn More
In this paper, we propose a simple method for direct access to variable-to-fixed length codes (VF codes) by adding an auxiliary succinct index structure to the encoded text. The method solves the substring decompression problem in O(N/n+l) time in the average case, where N, n, and l are the original text length, the encoded text length, and the length of(More)
The Re-Pair algorithm proposed by Larsson and Moffat in 1999 is a simple grammar-based compression method that achieves an extremely high compression ratio. However, Re-Pair is an offline and very space consuming algorithm. Thus, to apply it to a very large text, we need to divide the text into smaller blocks. Consequently, if we share a part of the(More)
We address the problem of applying the Re-Pair [LM99] algorithm to large texts. The Re-Pair algorithm (Re-Pair) proposed by Larsson and Moffat in 1999 is a simple grammar-based compression method that achieves an extremely good compression ratio. However, Re-Pair is not applicable to a large text because it consumes much memory and runs in an offline(More)
  • 1