Pages that link to "Item:Q405573"
From MaRDI portal
The following pages link to A subquadratic algorithm for minimum palindromic factorization (Q405573):
Displaying 20 items.
- EERTREE: an efficient data structure for processing palindromes in strings (Q1678105) (← links)
- Algorithms and combinatorial properties on shortest unique palindromic substrings (Q1711666) (← links)
- Factorizing strings into repetitions (Q2135631) (← links)
- Palindromic length and reduction of powers (Q2166768) (← links)
- Dynamic and internal longest common substring (Q2211363) (← 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)
- An efficient algorithm for the longest common palindromic subsequence problem (Q2672607) (← links)
- Diverse Palindromic Factorization Is NP-complete (Q3451091) (← links)
- Diverse Palindromic Factorization is NP-Complete (Q4640035) (← links)
- Greedy Palindromic Lengths (Q4640335) (← links)
- Comparing Degenerate Strings (Q4988951) (← links)
- On the size of overlapping Lempel-Ziv and Lyndon factorizations (Q5088921) (← links)
- (Q5089256) (← links)
- (Q5090361) (← 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)
- Maximal degenerate palindromes with gaps and mismatches (Q6073887) (← links)
