The following pages link to EERTREE (Q33836):
Displaying 17 items.
- Palindromic rich words and run-length encodings (Q738876) (← links)
- Algorithms and combinatorial properties on shortest unique palindromic substrings (Q1711666) (← links)
- Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings (Q2032287) (← links)
- Minimal unique palindromic substrings after single-character substitution (Q2146122) (← links)
- Ostrowski-automatic sequences: theory and applications (Q2222098) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Palindromic trees for a sliding window and its applications (Q2234804) (← links)
- Palindromic decompositions with gaps and errors (Q2399364) (← links)
- Palindromic length of words and morphisms in class \(\mathcal{P}\) (Q2420618) (← links)
- Diverse Palindromic Factorization is NP-Complete (Q4640035) (← links)
- Greedy Palindromic Lengths (Q4640335) (← links)
- Comparing Degenerate Strings (Q4988951) (← links)
- On Morphisms Preserving Palindromic Richness (Q5066068) (← links)
- Detecting One-Variable Patterns (Q5150937) (← links)
- Counting Palindromes in Substrings (Q5150941) (← links)
- Prefix palindromic length of the Thue-Morse word (Q5212137) (← links)
- Palindromic Decompositions with Gaps and Errors (Q5384622) (← links)
