EERTREE
From MaRDI portal
Software:33836
No author found.
Related Items (17)
Prefix palindromic length of the Thue-Morse word ⋮ Minimal unique palindromic substrings after single-character substitution ⋮ On Morphisms Preserving Palindromic Richness ⋮ Palindromic decompositions with gaps and errors ⋮ Palindromic length of words and morphisms in class \(\mathcal{P}\) ⋮ Algorithms and combinatorial properties on shortest unique palindromic substrings ⋮ Palindromic Decompositions with Gaps and Errors ⋮ 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 ⋮ Detecting One-Variable Patterns ⋮ Counting Palindromes in Substrings ⋮ Diverse Palindromic Factorization is NP-Complete ⋮ Greedy Palindromic Lengths ⋮ Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings ⋮ Palindromic rich words and run-length encodings ⋮ Comparing Degenerate Strings
This page was built for software: EERTREE
