Minimal unique palindromic substrings after single-character substitution
From MaRDI portal
Publication:2146122
DOI10.1007/978-3-030-86692-1_4OpenAlexW3202838341MaRDI QIDQ2146122
Mitsuru Funakoshi, Takuya Mieno
Publication date: 15 June 2022
Full work available at URL: https://arxiv.org/abs/2105.11693
Related Items
The heaviest induced ancestors problem: better data structures and applications, Shortest unique palindromic substring queries in semi-dynamic settings, Data structures for computing unique palindromes in static and non-static strings
Uses Software
Cites Work
- Unnamed Item
- Longest common extensions in trees
- Parallel detection of all palindromes in a string
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- EERTREE: an efficient data structure for processing palindromes in strings
- Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets
- Algorithms and combinatorial properties on shortest unique palindromic substrings
- Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings
- Computing longest palindromic substring after single-character or block-wise edits
- Palindromic trees for a sliding window and its applications
- Interval Stabbing Problems in Small Integer Ranges
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- A Linear-Time Algorithm for Seeds Computation
- Repetition Detection in a Dynamic String
- Longest common substring made fully dynamic
- Longest Lyndon Substring After Edit
- The Heaviest Induced Ancestors Problem Revisited
- Longest Common Factor After One Edit Operation
- On the sorting-complexity of suffix tree construction
- Episturmian words and some constructions of de Luca and Rauzy
