5 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.DS2011
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…
cs.DS2011
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…
cs.DS2011★ 5 cited
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…