106 citations · 150 across the 16 of their papers we have counts for
4 papers · 1 filter
Longest Common Extensions with Recompression
Tomohiro I
Given two positions and in a string of length , a longest common extension (LCE) query asks for the length of the longest common prefix between suffixes beginning at…
Online Grammar Compression for Frequent Pattern Discovery
Shouhei Fukunaga, Yoshimasa Takabatake, I Tomohiro +1
Various grammar compression algorithms have been proposed in the last decade. A grammar compression is a restricted CFG deriving the string deterministically. An efficient grammar…
Dynamic index and LZ factorization in compressed space
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga +2
In this paper, we propose a new \emph{dynamic compressed index} of space for a dynamic text , where is the size of the signature encodi…
Deterministic sub-linear space LCE data structures with efficient construction
Yuka Tanimura, Tomohiro I, Hideo Bannai +3
Given a string of symbols, a longest common extension query asks for the length of the longest common prefix of the th and th suffixes of . LCE…