Pages that link to "Item:Q407601"
From MaRDI portal
The following pages link to Counting distinct palindromes in a word in linear time (Q407601):
Displaying 18 items.
- Palindrome pattern matching (Q390901) (← links)
- Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes (Q1625598) (← links)
- EERTREE: an efficient data structure for processing palindromes in strings (Q1678105) (← links)
- Algorithms and combinatorial properties on shortest unique palindromic substrings (Q1711666) (← links)
- Internal dictionary matching (Q2037109) (← 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)
- An efficient algorithm for the longest common palindromic subsequence problem (Q2672607) (← links)
- Enumeration of two dimensional palindromes (Q2672656) (← links)
- Palindrome Pattern Matching (Q3011857) (← links)
- Improved estimates for the number of privileged words (Q4639881) (← links)
- Greedy Palindromic Lengths (Q4640335) (← links)
- Faster queries for longest substring palindrome after block edit (Q5088918) (← links)
- Longest substring palindrome after edit (Q5140775) (← links)
- Counting Palindromes in Substrings (Q5150941) (← links)
- Tight bound for the number of distinct palindromes in a tree (Q6042101) (← links)
- Finding top-\(k\) longest palindromes in substrings (Q6057835) (← links)
- On longest common property preserved substring queries (Q6536252) (← links)
