The following pages link to (Q4547735):
Displaying 11 items.
- Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850) (← links)
- Computing similarity of run-length encoded strings with affine gap penalty (Q932322) (← links)
- Hardness of comparing two run-length encoded strings (Q990818) (← links)
- Matching for run-length encoded strings (Q1288529) (← links)
- Approximate matching of run-length compressed strings (Q1402213) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- Edit distance of run-length encoded strings. (Q1853090) (← links)
- A fully compressed algorithm for computing the edit distance of run-length encoded strings (Q1939665) (← links)
- Binary jumbled string matching for highly run-length compressible texts (Q2444848) (← links)
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (Q3637111) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
