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