38 citations · 43 across the 4 of their papers we have counts for
5 papers
Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga +1
Length- substrings, or -grams, can represent important characteristics of text data, and determining the frequencies of all -grams contained in the data is an important pr…
Computing q-gram Frequencies on Collage Systems
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga +1
Collage systems are a general framework for representing outputs of various text compression algorithms. We consider the all -gram frequency problem on compressed string represe…
Restructuring Compressed Texts without Explicit Decompression
Keisuke Goto, Shirou Maruyama, Shunsuke Inenaga +3
We consider the problem of {\em restructuring} compressed texts without explicit decompression. We present algorithms which allow conversions from compressed representations of a s…
Fast -gram Mining on SLP Compressed Strings
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga +1
We present simple and efficient algorithms for calculating -gram frequencies on strings represented in compressed form, namely, as a straight line program (SLP). Given an SLP of…
New Lower Bounds for the Maximum Number of Runs in a String
Kazuhiko Kusano, Wataru Matsubara, Akira Ishino +2
We show a new lower bound for the maximum number of runs in a string. We prove that for any e > 0, (a -- e)n is an asymptotic lower bound, where a = 56733/60064 = 0.944542. It is s…