A RUN-TIME EFFICIENT IMPLEMENTATION OF COMPRESSED PATTERN MATCHING AUTOMATA

DOI10.1142/S0129054109006838MaRDI QIDQ3395142zbMATH OpenFDO

Authors Tetsuya Matsumoto, Kazuhito Hagio, Masayuki Takeda

Publication date 21 August 2009

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054109006838

zbMATH Keywords

compressed pattern matchingimplementation of automatapattern matching over compressed texts

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Formal languages and automata (68Q45) Algorithms on strings (68W32)

Recommendations

• A Run-Time Efficient Implementation of Compressed Pattern Matching Automata
• A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS
• scientific article; zbMATH DE number 1615280
• Compressed automata for dictionary matching
• Compressed automata for dictionary matching

Cites work

• 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.

Cited in

(1)

• A Run-Time Efficient Implementation of Compressed Pattern Matching Automata

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 Q3395142)