Compressed automata for dictionary matching
From MaRDI portal
Publication:2344744
Recommendations
Cites work
- scientific article; zbMATH DE number 1045405 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- A universal algorithm for sequential data compression
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Collage system: A unifying framework for compressed pattern matching.
- Compression of individual sequences via variable-rate coding
- Data compression via textual substitution
- Efficient algorithms for Lempel-Ziv encoding
- Efficient string matching
- Lempel-Ziv-78 compressed string dictionaries
- Random access to grammar-compressed strings
- Succinct Dictionary Matching with No Slowdown
Cited in
(7)- Finger search in grammar-compressed strings
- Efficient dictionary matching by Aho-Corasick automata of truncated patterns
- Collage system: A unifying framework for compressed pattern matching.
- Unification and matching on compressed terms
- Compressed automata for dictionary matching
- Computer Science Logic
- A RUN-TIME EFFICIENT IMPLEMENTATION OF COMPRESSED PATTERN MATCHING AUTOMATA
This page was built for publication: Compressed automata for dictionary matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344744)