10 citations · 15 across the 5 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
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…
cs.DS2011
A Searchable Compressed Edit-Sensitive Parsing
Naoya Kishiue, Masaya Nakahara, Shirou Maruyama +1
Practical data structures for the edit-sensitive parsing (ESP) are proposed. Given a string S, its ESP tree is equivalent to a context-free grammar G generating just S, which is re…