Shortest unique palindromic substring queries in optimal time

Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Research output: Chapter in Book/Report/Conference proceedingConference contribution


palindrome is a string that reads the same forward and backward. A palindromic substring P of a string S is called a shortest unique palindromic substring (SUPS) for an interval [s, t] in S, if P occurs exactly once in S, this occurrence of P contains interval [s, t], and every palindromic substring of S which contains interval [s, t] and is shorter than P occurs at least twice in S. The SUPS problem is, given a string S, to preprocess S so that for any subsequent query interval [s, t] all the SUPSs for interval [s, t] can be answered quickly. We present an optimal solution to this problem. Namely, we show how to preprocess a given string S of length n in O(n) time and space so that all SUPSs for any subsequent query interval can be answered in O(α + 1) time, where α is the number of outputs.

Original languageEnglish
Title of host publicationCombinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers
EditorsWilliam F. Smyth, Ljiljana Brankovic, Joe Ryan
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783319788241
Publication statusPublished - 2018
Event28th International Workshop on Combinational Algorithms, IWOCA 2017 - Newcastle, NSW, Australia
Duration: Jul 17 2017Jul 21 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10765 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other28th International Workshop on Combinational Algorithms, IWOCA 2017
CityNewcastle, NSW

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Shortest unique palindromic substring queries in optimal time'. Together they form a unique fingerprint.

Cite this