Data structures for computing unique palindromes in static and non-static strings
From MaRDI portal
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
- Efficient algorithms for Lempel-Ziv encoding
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- 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
- Parallel detection of all palindromes in a string
- 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 substrings queries in optimal time
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- The heaviest induced ancestors problem: better data structures and applications
- Tight tradeoffs for real-time approximation of longest palindromes in streams
- Uniqueness Theorems for Periodic Functions
This page was built for publication: Data structures for computing unique palindromes in static and non-static strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6119834)
