Shortest unique palindromic substring queries in semi-dynamic settings

DOI10.1007/978-3-031-06678-8_31OpenAlexW4224248754MaRDI QIDQ2169977

Takuya Mieno, Mitsuru Funakoshi

Publication date: 30 August 2022

Full work available at URL: https://arxiv.org/abs/2204.07327

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Preserving order in a forest in less than logarithmic time and linear space
• Shortest unique palindromic substring queries in optimal time
• Algorithms and combinatorial properties on shortest unique palindromic substrings
• On-line construction of suffix trees
• Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings
• Computing minimal unique substrings for a sliding window
• Minimal unique palindromic substrings after single-character substitution
• Dynamic and internal longest common substring
• Computing longest palindromic substring after single-character or block-wise edits
• Palindromic trees for a sliding window and its applications
• Absent words in a sliding window with applications
• Tight tradeoffs for real-time approximation of longest palindromes in streams
• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• A universal algorithm for sequential data compression
• Algorithms on Strings, Trees and Sequences
• Repetition Detection in a Dynamic String
• Longest Lyndon Substring After Edit
• The Heaviest Induced Ancestors Problem Revisited
• Longest Common Factor After One Edit Operation
• Path Minima Queries in Dynamic Weighted Trees
• Uniqueness Theorems for Periodic Functions

This page was built for publication: Shortest unique palindromic substring queries in semi-dynamic settings