swMATH22040MaRDI QIDQ33836FDOQ33836
Author name not available (Why is that?)
Official website: https://link.springer.com/chapter/10.1007%2F978-3-319-29516-9_27
Cited In (17)
- Palindromic decompositions with gaps and errors
- Palindromic rich words and run-length encodings
- Palindromic decompositions with gaps and errors
- Comparing Degenerate Strings
- Algorithms and combinatorial properties on shortest unique palindromic substrings
- Ostrowski-automatic sequences: theory and applications
- Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings
- Minimal unique palindromic substrings after single-character substitution
- Computing longest palindromic substring after single-character or block-wise edits
- Prefix palindromic length of the Thue-Morse word
- Palindromic length of words and morphisms in class \(\mathcal{P}\)
- Palindromic trees for a sliding window and its applications
- Detecting one-variable patterns
- Greedy palindromic lengths
- On Morphisms Preserving Palindromic Richness
- Diverse Palindromic Factorization is NP-Complete
- Counting palindromes in substrings
This page was built for software: EERTREE
