Pages that link to "Item:Q5448662"
From MaRDI portal
The following pages link to Computing Longest Common Substring and All Palindromes from Compressed Strings (Q5448662):
Displaying 4 items.
- Straight-line programs: a practical test (extended abstract) (Q376125) (← links)
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes (Q1006070) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Computing a Longest Common Palindromic Subsequence (Q2876577) (← links)