• Home
  • Search
  • Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings
  • Open Access IconOpen Access
  • Cite Icon2
  • https://doi.org/10.1007/978-3-031-06678-8_31Copy DOI Icon

Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings

  • Jan 1, 2022
  • Takuya Mieno +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

A palindromic substring $T[i.. j]$ of a string $T$ is said to be a shortest unique palindromic substring (SUPS) in $T$ for an interval $[p, q]$ if $T[i.. j]$ is a shortest one such that $T[i.. j]$ occurs only once in $T$, and $[i, j]$ contains $[p, q]$. The SUPS problem is, given a string $T$ of length $n$, to construct a data structure that can compute all the SUPSs for any given query interval. It is known that any SUPS query can be answered in $O(\alpha)$ time after $O(n)$-time preprocessing, where $\alpha$ is the number of SUPSs to output [Inoue et al., 2018]. In this paper, we first show that $\alpha$ is at most $4$, and the upper bound is tight. Also, we present an algorithm to solve the SUPS problem for a sliding window that can answer any query in $O(\log\log W)$ time and update data structures in amortized $O(\log\sigma)$ time, where $W$ is the size of the window, and $\sigma$ is the alphabet size. Furthermore, we consider the SUPS problem in the after-edit model and present an efficient algorithm. Namely, we present an algorithm that uses $O(n)$ time for preprocessing and answers any $k$ SUPS queries in $O(\log n\log\log n + k\log\log n)$ time after single character substitution. As a by-product, we propose a fully-dynamic data structure for range minimum queries (RmQs) with a constraint where the width of each query range is limited to polylogarithmic. The constrained RmQ data structure can answer such a query in constant time and support a single-element edit operation in amortized constant time.

Similar Papers
  • Conference Article
  • Citations30

Range Selection and Median: Tight Cell Probe Lower Bounds and Adaptive Data Structures

  • Jan 23, 2011
  • Allan Grønlund Jørgensen +1
  • Research Article
  • Citations11

Near-Optimal Data Structure for Approximate Range Emptiness Problem in Information-Centric Internet of Things

  • Jan 01, 2019
  • IEEE Access
  • Xiujun Wang +5
  • Conference Article
  • Citations6

Nearly optimal static Las Vegas succinct dictionary

  • Jun 22, 2020
  • Huacheng Yu
  • Research Article
  • Citations17

Finding Range Minima in the Middle: Approximations and Applications

  • Nov 27, 2009
  • Mathematics in Computer Science
  • Johannes Fischer +1
  • Research Article
  • Citations26

Encoding range minima and range top-2 queries.

  • May 28, 2014
  • Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • Pooya Davoodi +3
  • Book Chapter
  • Citations6

A constant update time finger search tree

  • Jan 01, 1990
  • Paul Dietz +1
  • Conference Article
  • Citations2

The Space Complexity of 2-Dimensional Approximate Range Counting

  • Jan 06, 2013
  • Zhewei Wei +1
  • Conference Article
  • Citations5

The space complexity of 2-dimensional approximate range counting

  • Jan 06, 2013
  • Zhewei Wei +1
  • Conference Article
  • Citations5

External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates.

  • Jan 01, 2016
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Gerth Stølting Brodal
  • Research Article
  • Citations2

Top Tree Compression of Tries

  • Aug 20, 2021
  • Algorithmica
  • Philip Bille +4
  • Research Article
  • Citations19

Lower and upper bounds on obtaining history independence

  • Jan 06, 2006
  • Information and Computation
  • Niv Buchbinder +1
  • PDF
  • Research Article
  • Citations7

Clinical Prediction Models for Hospital-Induced Delirium Using Structured and Unstructured Electronic Health Record Data: Protocol for a Development and Validation Study.

  • Nov 09, 2023
  • JMIR Research Protocols
  • Sarah E Ser +7
  • Book Chapter
  • Citations12

Limits of Preprocessing for Single-Server PIR

  • Jan 01, 2022
  • Giuseppe Persiano +1
  • Conference Article
  • Citations21

Dynamic suffix array with polylogarithmic queries and updates

  • Jun 09, 2022
  • Dominik Kempa +1
  • Book Chapter
  • Citations131

A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array

  • Apr 07, 2007
  • Johannes Fischer +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.