Compressed pattern matching for SEQUITUR
Authors:
- S. MitaraiSMS. Mitarai
- M. HiraoMHM. Hirao
- T. MatsumotoTMT. Matsumoto
- A. ShinoharaASA. Shinohara
- M. TakedaMTM. Takeda
- S. ArikawaSAS. Arikawa
- 13 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A unifying framework for compressed pattern matching2003
- Multiple pattern matching in LZW compressed text2002
- Faster approximate string matching over compressed text2002
- Bit-parallel approach to approximate string matching in compressed texts2002
- Approximate String Matching over Ziv—Lempel Compressed Text2000
- A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text1999
- Offline dictionary-based compression1999
- A text compression scheme that allows fast searching directly in the compressed fileACM Transactions on Information Systems, 1997
- Compression and Explanation using Hierarchical GrammarsThe Computer Journal, 1997
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977