Pages that link to "Item:Q1386349"
From MaRDI portal
The following pages link to String matching in Lempel-Ziv compressed strings (Q1386349):
Displaying 24 items.
- One-dimensional staged self-assembly (Q256717) (← links)
- Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850) (← links)
- Lempel-Ziv-78 compressed string dictionaries (Q724216) (← links)
- Practical and flexible pattern matching over Ziv-Lempel compressed text. (Q878012) (← links)
- Compressed parameterized pattern matching (Q897868) (← links)
- Efficient on-line repetition detection (Q955034) (← links)
- Time-space trade-offs for Lempel-Ziv compressed indexing (Q1694685) (← links)
- Regular expression searching on compressed text (Q1827268) (← links)
- Approximate string matching on Ziv--Lempel compressed text (Q1827277) (← links)
- Direct merging of delta encoded files (Q2295635) (← links)
- Sublinear algorithms for approximating string compressibility (Q2392931) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- Sensitivity of string compressors and repetitiveness measures (Q2687989) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- On the bit-complexity of Lempel-Ziv compression (Q2862201) (← links)
- Substring compression problems (Q2921685) (← links)
- THE INCLUSION PROBLEM OF CONTEXT-FREE LANGUAGES: SOME TRACTABLE CASES (Q3086239) (← links)
- Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic (Q3092248) (← links)
- One-Dimensional Staged Self-assembly (Q3092336) (← links)
- The Inclusion Problem of Context-Free Languages: Some Tractable Cases (Q3637217) (← links)
- Bicriteria Data Compression (Q5242925) (← links)
- Computer Science Logic (Q5292652) (← links)
- A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS (Q5714664) (← links)
- An experimental study of a compressed index (Q5944434) (← links)
