The following pages link to Substring compression problems (Q2921685):
Displaying 14 items.
- Computing minimal and maximal suffixes of a substring (Q294952) (← links)
- Sublinear algorithms for approximating string compressibility (Q2392931) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- Generalized substring compression (Q2437745) (← links)
- Adaptive learning of compressible strings (Q2664947) (← links)
- Sensitivity of string compressors and repetitiveness measures (Q2687989) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- Finding characteristic substrings from compressed texts (Q2909195) (← links)
- Substring Range Reporting (Q3011863) (← links)
- Avoiding substrings in compositons (Q3015585) (← links)
- Bicriteria Data Compression (Q5242925) (← links)
- A linear-space data structure for range-LCP queries in poly-logarithmic time (Q5918832) (← links)
- Range LCP (Q5920340) (← links)
- Internal pattern matching queries in a text and applications (Q6621750) (← links)