Compressed automata for dictionary matching
From MaRDI portal
Publication:2344744
DOI10.1016/J.TCS.2015.01.019zbMATH Open1312.68118OpenAlexW2058910920MaRDI QIDQ2344744FDOQ2344744
Authors: Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomohiro I 
Publication date: 18 May 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.019
Recommendations
pattern matchingdictionary matchingAho-Corasick automatonstraight-line programMorris-Pratt automaton
Cites Work
- Efficient string matching
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Compression of individual sequences via variable-rate coding
- Random access to grammar-compressed strings
- A universal algorithm for sequential data compression
- Title not available (Why is that?)
- Collage system: A unifying framework for compressed pattern matching.
- Succinct Dictionary Matching with No Slowdown
- Data compression via textual substitution
- Title not available (Why is that?)
- Efficient algorithms for Lempel-Ziv encoding
- Lempel-Ziv-78 compressed string dictionaries
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)
