Shortest unique palindromic substring queries on run-length encoded strings
K Watanabe, Y Nakashima, S Inenaga… - International Workshop …, 2019 - Springer
For a string S, a palindromic substring S i.. j is said to be a shortest unique palindromic
substring (SUPS) for an interval s, t in S, if S i.. j occurs exactly once in S, the interval i, j
contains s, t, and every palindromic substring containing s, t which is shorter than S i.. j
occurs at least twice in S. In this paper, we study the problem of answering SUPS queries on
run-length encoded strings. We show how to preprocess a given run-length encoded string
RLE _ S of size m in O (m) space and O (m\log σ _ RLE _ S+ m\log m/\log\log m) time so that …
substring (SUPS) for an interval s, t in S, if S i.. j occurs exactly once in S, the interval i, j
contains s, t, and every palindromic substring containing s, t which is shorter than S i.. j
occurs at least twice in S. In this paper, we study the problem of answering SUPS queries on
run-length encoded strings. We show how to preprocess a given run-length encoded string
RLE _ S of size m in O (m) space and O (m\log σ _ RLE _ S+ m\log m/\log\log m) time so that …
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings
M Takeda - Combinatorial Algorithms - Springer
For a string S, a palindromic substring S [i.. j] is said to be a shortest unique palindromic
substring (SUPS) for an interval [s, t] in S, if S [i.. j] occurs exactly once in S, the interval [i, j]
contains [s, t], and every palindromic substring containing [s, t] which is shorter than S [i.. j]
occurs at least twice in S. In this paper, we study the problem of answering SUPS queries on
run-length encoded strings. We show how to preprocess a given run-length encoded string
RLES of size m in O (m) space and
substring (SUPS) for an interval [s, t] in S, if S [i.. j] occurs exactly once in S, the interval [i, j]
contains [s, t], and every palindromic substring containing [s, t] which is shorter than S [i.. j]
occurs at least twice in S. In this paper, we study the problem of answering SUPS queries on
run-length encoded strings. We show how to preprocess a given run-length encoded string
RLES of size m in O (m) space and
Showing the best results for this search. See all results