Shortest unique palindromic substring queries in semi-dynamic settings

DOI10.1007/978-3-031-06678-8_31MaRDI QIDQ2169977zbMATH OpenOpenAlexFDO

Authors Takuya Mieno, Mitsuru Funakoshi

Publication date 30 August 2022

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

Mathematics Subject Classification ID

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

Cites work

• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• A universal algorithm for sequential data compression
• Absent words in a sliding window with applications
• Algorithms and combinatorial properties on shortest unique palindromic substrings
• Algorithms on Strings, Trees and Sequences
• Computing longest palindromic substring after single-character or block-wise edits
• Computing minimal unique substrings for a sliding window
• Dynamic and internal longest common substring
• Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings
• scientific article; zbMATH DE number 6850408 (Why is no real title available?)
• Longest common factor after one edit operation
• Longest Lyndon Substring After Edit
• Minimal unique palindromic substrings after single-character substitution
• On-line construction of suffix trees
• Palindromic trees for a sliding window and its applications
• Path minima queries in dynamic weighted trees
• Preserving order in a forest in less than logarithmic time and linear space
• Repetition Detection in a Dynamic String
• Shortest unique palindromic substring queries in optimal time
• The heaviest induced ancestors problem revisited
• Tight tradeoffs for real-time approximation of longest palindromes in streams
• Uniqueness Theorems for Periodic Functions

Cited in

(6)

• Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings
• Shortest Unique Substring Queries on Run-Length Encoded Strings
• Faster queries for longest substring palindrome after block edit
• Minimizers in semi-dynamic strings
• Double-ended palindromic trees in linear time
• Maintaining the size of LZ77 on semi-dynamic strings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169977)