Palindromic length in linear time
From MaRDI portal
Recommendations
Cited in
(24)- The derivation of on-line algorithms, with an application to finding palindromes
- Palindrome complexity.
- Factorizing strings into repetitions
- Palindromic length and reduction of powers
- Dynamic and internal longest common substring
- On highly palindromic words: the \(n\)-ary case
- On prefix palindromic length of automatic words
- An efficient algorithm for the longest common palindromic subsequence problem
- Counting distinct palindromes in a word in linear time
- Diverse Palindromic Factorization is NP-Complete
- Comparing Degenerate Strings
- On the size of overlapping Lempel-Ziv and Lyndon factorizations
- scientific article; zbMATH DE number 7559452 (Why is no real title available?)
- Counting palindromes in substrings
- Computing palindromic factorizations and palindromic covers on-line
- \(\mathrm{Pal}^{k}\) is linear recognizable online
- Prefix palindromic length of the Thue-Morse word
- Combinatorics of palindromes
- Double-ended palindromic trees in linear time
- Searching 2D-strings for matching frames
- Palindromic length of infinite aperiodic words
- Efficient algorithms for computing the edit distance with non-overlapping inversions
- Small space encoding and recognition of k-palindromic prefixes
- On highly palindromic words: the ternary case
This page was built for publication: Palindromic length in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5110889)
