The following pages link to Palindromic length in linear time (Q5110889):
Displaying 10 items.
- On highly palindromic words: the ternary case (Q777417) (← links)
- EERTREE: an efficient data structure for processing palindromes in strings (Q1678105) (← links)
- Factorizing strings into repetitions (Q2135631) (← links)
- Palindromic length and reduction of powers (Q2166768) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- On highly palindromic words: the \(n\)-ary case (Q2231750) (← links)
- On prefix palindromic length of automatic words (Q2235743) (← links)
- An efficient algorithm for the longest common palindromic subsequence problem (Q2672607) (← links)
- On the size of overlapping Lempel-Ziv and Lyndon factorizations (Q5088921) (← links)
- (Q5089256) (← links)
