A Run-Time Efficient Implementation of Compressed Pattern Matching Automata
From MaRDI portal
Recommendations
- A RUN-TIME EFFICIENT IMPLEMENTATION OF COMPRESSED PATTERN MATCHING AUTOMATA
- A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS
- A Boyer-Moore type algorithm for compressed pattern matching
- Multiple pattern matching algorithms on collage system
- Compressed automata for dictionary matching
Cites work
- A Boyer-Moore type algorithm for compressed pattern matching
- Collage system: A unifying framework for compressed pattern matching.
- Grammar-based codes: a new class of universal lossless source codes
- Let sleeping files lie: Pattern matching in Z-compressed files.
- Speeding up pattern matching by text compression
- String matching with stopper encoding and code splitting
Cited in
(2)
This page was built for publication: A Run-Time Efficient Implementation of Compressed Pattern Matching Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602815)