A RUN-TIME EFFICIENT IMPLEMENTATION OF COMPRESSED PATTERN MATCHING AUTOMATA

DOI10.1142/S0129054109006838zbMath1180.68160MaRDI QIDQ3395142

Tetsuya Matsumoto, Masayuki Takeda, Kazuhito Hagio

Publication date: 21 August 2009

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

zbMATH Keywords

compressed pattern matchingimplementation of automatapattern matching over compressed texts

Mathematics Subject Classification ID

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

Cites Work

• Let sleeping files lie: Pattern matching in Z-compressed files.
• Collage system: A unifying framework for compressed pattern matching.
• Grammar-based codes: a new class of universal lossless source codes

This page was built for publication: A RUN-TIME EFFICIENT IMPLEMENTATION OF COMPRESSED PATTERN MATCHING AUTOMATA