Pages that link to "Item:Q1006070"
From MaRDI portal
The following pages link to Efficient algorithms to compute compressed longest common substrings and compressed palindromes (Q1006070):
Displayed 21 items.
- Compact q-gram profiling of compressed strings (Q401308) (← links)
- A subquadratic algorithm for minimum palindromic factorization (Q405573) (← links)
- Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850) (← links)
- An efficient algorithm to test square-freeness of strings compressed by straight-line programs (Q456098) (← links)
- Functional programs as compressed data (Q526441) (← links)
- Linear-time text compression by longest-first substitution (Q1662518) (← links)
- Finding maximal 2-dimensional palindromes (Q1740657) (← links)
- Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings (Q2032287) (← links)
- Minimal unique palindromic substrings after single-character substitution (Q2146122) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Palindromic subsequence automata and longest common palindromic subsequence (Q2363997) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Detecting regularities on grammar-compressed strings (Q2514148) (← links)
- Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts (Q2891377) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
- FINDING CHARACTERISTIC SUBSTRINGS FROM COMPRESSED TEXTS (Q2909195) (← links)
- FINDING ALL APPROXIMATE GAPPED PALINDROMES (Q3069733) (← links)
- Faster queries for longest substring palindrome after block edit (Q5088918) (← links)
- A Space-Optimal Grammar Compression. (Q5111756) (← links)
- Longest substring palindrome after edit (Q5140775) (← links)
- Finding top-\(k\) longest palindromes in substrings (Q6057835) (← links)