Pages that link to "Item:Q1860243"
From MaRDI portal
The following pages link to Finding approximate palindromes in strings (Q1860243):
Displaying 10 items.
- Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850) (← links)
- Searching for gapped palindromes (Q1038475) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Palindromic subsequence automata and longest common palindromic subsequence (Q2363997) (← links)
- An efficient algorithm for the longest common palindromic subsequence problem (Q2672607) (← links)
- FINDING ALL APPROXIMATE GAPPED PALINDROMES (Q3069733) (← links)
- Searching for Gapped Palindromes (Q3506939) (← links)
- Faster queries for longest substring palindrome after block edit (Q5088918) (← links)
- Longest substring palindrome after edit (Q5140775) (← links)
- Palindromic Decompositions with Gaps and Errors (Q5384622) (← links)
