1 research outputs found
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings
For a string , a palindromic substring is said to be a
\emph{shortest unique palindromic substring} () for an interval
in , if occurs exactly once in , the interval
contains , and every palindromic substring containing which is
shorter than occurs at least twice in . In this paper, we study
the problem of answering queries on run-length encoded strings.
We show how to preprocess a given run-length encoded string
of size in space and time so that all for any
subsequent query interval can be answered in time, where is the number of outputs, and
is the number of distinct runs of
. Additionaly, we consider a variant of the SUPS problem
where a query interval is also given in a run-length encoded form. For this
variant of the problem, we present two alternative algorithms with faster
queries. The first one answers queries in time and can be built in time, and the second one answers queries in
time and can be built in time. Both of these data structures require
space