The following pages link to Searching for gapped palindromes (Q1038475):
Displaying 21 items.
- Palindrome pattern matching (Q390901) (← links)
- Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850) (← links)
- Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes (Q1625598) (← links)
- Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets (Q1702853) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
- Efficient computation of longest single-arm-gapped palindromes in a string (Q2297859) (← links)
- Local symmetry dynamics in one-dimensional aperiodic lattices: a numerical study (Q2346793) (← links)
- Palindromic subsequence automata and longest common palindromic subsequence (Q2363997) (← links)
- Palindromic decompositions with gaps and errors (Q2399364) (← links)
- Detecting regularities on grammar-compressed strings (Q2514148) (← links)
- Finding Gapped Palindromes Online (Q2819503) (← links)
- Longest Gapped Repeats and Palindromes (Q2946337) (← links)
- Longest $$\alpha $$-Gapped Repeat and Palindrome (Q2947867) (← links)
- Computing Longest Single-arm-gapped Palindromes in a String (Q2971149) (← links)
- Palindrome Pattern Matching (Q3011857) (← links)
- Faster queries for longest substring palindrome after block edit (Q5088918) (← links)
- Small-space LCE data structure with constant-time queries (Q5111224) (← links)
- Longest substring palindrome after edit (Q5140775) (← links)
- Palindromic Decompositions with Gaps and Errors (Q5384622) (← links)
- Maximal degenerate palindromes with gaps and mismatches (Q6073887) (← links)
