Regular expression searching on compressed text

DOI10.1016/S1570-8667(03)00036-4zbMath1100.68056MaRDI QIDQ1827268

Gonzalo Navarro

Publication date: 6 August 2004

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

zbMATH Keywords

AutomataRegular languagesBit-parallelismCompressed pattern matchingZiv--Lempel

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (1)

Engineering Practical Lempel-Ziv Tries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• From regular expressions to deterministic automata
• Let sleeping files lie: Pattern matching in Z-compressed files.
• String matching in Lempel-Ziv compressed strings
• NR‐grep: a fast and flexible pattern‐matching tool
• THE ABSTRACT THEORY OF AUTOMATA
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• A Four Russians algorithm for regular expression pattern matching
• Fast text searching for regular expressions or automaton searching on tries
• A new regular grammar pattern matching algorithm
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• A Method for the Construction of Minimum-Redundancy Codes
• Programming Techniques: Regular expression search algorithm

This page was built for publication: Regular expression searching on compressed text