Minimal unique palindromic substrings after single-character substitution
From MaRDI portal
Publication:2146122
Cites work
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- Algorithms and combinatorial properties on shortest unique palindromic substrings
- Computing longest palindromic substring after single-character or block-wise edits
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- Episturmian words and some constructions of de Luca and Rauzy
- Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings
- scientific article; zbMATH DE number 7559452 (Why is no real title available?)
- Interval Stabbing Problems in Small Integer Ranges
- Longest common extensions in trees
- Longest common factor after one edit operation
- Longest common substring made fully dynamic
- Longest Lyndon Substring After Edit
- On the sorting-complexity of suffix tree construction
- Palindromic trees for a sliding window and its applications
- Parallel detection of all palindromes in a string
- Repetition Detection in a Dynamic String
- The heaviest induced ancestors problem revisited
- Tighter bounds and optimal algorithms for all maximal -gapped repeats and palindromes. Finding all maximal -gapped repeats and palindromes in optimal worst case time on integer alphabets
Cited in
(6)- The heaviest induced ancestors problem: better data structures and applications
- Shortest unique palindromic substring queries in semi-dynamic settings
- Longest substring palindrome after edit
- Data structures for computing unique palindromes in static and non-static strings
- Double-ended palindromic trees in linear time
- Shortest cover after edit
This page was built for publication: Minimal unique palindromic substrings after single-character substitution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146122)
