Cited in
(17)- On Morphisms Preserving Palindromic Richness
- Palindromic trees for a sliding window and its applications
- Ostrowski-automatic sequences: theory and applications
- Palindromic length of words and morphisms in class \(\mathcal{P}\)
- Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings
- Counting palindromes in substrings
- Greedy palindromic lengths
- Palindromic rich words and run-length encodings
- Computing longest palindromic substring after single-character or block-wise edits
- Prefix palindromic length of the Thue-Morse word
- Palindromic decompositions with gaps and errors
- Diverse Palindromic Factorization is NP-Complete
- Algorithms and combinatorial properties on shortest unique palindromic substrings
- Comparing Degenerate Strings
- Palindromic decompositions with gaps and errors
- Minimal unique palindromic substrings after single-character substitution
- Detecting one-variable patterns
This page was built for software: EERTREE
