The following pages link to (Q4234121):
Displaying 15 items.
- On compressing and indexing repetitive sequences (Q390894) (← links)
- String matching over compressed text on handheld devices using tagged sub-optimal code (TSC) (Q813136) (← links)
- Practical and flexible pattern matching over Ziv-Lempel compressed text. (Q878012) (← links)
- Inplace run-length 2d compressed search. (Q1401164) (← links)
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression. (Q1401326) (← links)
- Compressed matching in dictionaries (Q1736479) (← links)
- The complexity of compressing subsegments of images described by finite automata (Q1861562) (← links)
- On the complexity of pattern matching for highly compressed two-dimensional texts. (Q1872708) (← links)
- Collage system: A unifying framework for compressed pattern matching. (Q1874240) (← links)
- The complexity of compressed membership problems for finite automata (Q2254509) (← links)
- Compressed string-matching in standard Sturmian words (Q2271418) (← links)
- Simple and efficient LZW-compressed multiple pattern matching (Q2442814) (← links)
- Efficient algorithms for Lempel-Ziv encoding (Q5054830) (← links)
- Pattern-matching problems for 2-dimensional images described by finite automata (Q5055939) (← links)
- (Q6065473) (← links)
