106 citations · 239 across the 67 of their papers we have counts for
6 papers · 2 filters
Computing All Distinct Squares in Linear Time for Integer Alphabets
Hideo Bannai, Shunsuke Inenaga, Dominik Köppl
Given a string on an integer alphabet, we present an algorithm that computes the set of all distinct squares belonging to this string in time linear to the string length. As an app…
Longest Common Subsequence in at Least Length Order-Isomorphic Substrings
Yohei Ueki, Diptarama, Masatoshi Kurihara +6
We consider the longest common subsequence (LCS) problem with the restriction that the common subsequence is required to consist of at least length substrings. First, we show a…
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…