Kiichi Watanabe

collaborators

2 papers

cs.DS2020

Palindromic Trees for a Sliding Window and Its Applications

Takuya Mieno, Kiichi Watanabe, Yuto Nakashima +3

The palindromic tree (a.k.a. eertree) for a string $S$ of length $n$ is a tree-like data structure that represents the set of all distinct palindromic substrings of $S$ , using $O(n…

cs.DS2019

Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings

Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga +2

For a string $S$ , a palindromic substring $S [i .. j]$ is said to be a \emph{shortest unique palindromic substring} ( $SUPS$ ) for an interval $[s, t]$ in $S$ , if $S [i .. j]$ occ…