106 citations · 187 across the 45 of their papers we have counts for
5 papers · 1 filter
Tight bounds on the maximum number of shortest unique substrings
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai +1
A substring Q of a string S is called a shortest unique substring (SUS) for interval [s,t] in S, if Q occurs exactly once in S, this occurrence of Q contains interval [s,t], and ev…
Shortest unique palindromic substring queries in optimal time
Yuto Nakashima, Hiroe Inoue, Takuya Mieno +3
A palindrome is a string that reads the same forward and backward. A palindromic substring of a string is called a shortest unique palindromic substring () f…
Fully dynamic data structure for LCE queries in compressed space
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga +2
A Longest Common Extension (LCE) query on a text of length asks for the length of the longest common prefix of suffixes starting at given two positions. We show that the si…
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…