Multiple pattern matching in LZW compressed text
Authors:
- T. KidaTKT. Kida
- M. TakedaMTM. Takeda
- A. ShinoharaASA. Shinohara
- M. MiyazakiMMM. Miyazaki
- S. ArikawaSAS. Arikawa
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 103-112
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Efficient two-dimensional compressed matching2003
- An improved pattern matching algorithm for strings in terms of straight-line programs1997
- Let Sleeping Files Lie: Pattern Matching in Z-Compressed FilesJournal of Computer and System Sciences, 1996
- String matching in Lempel-Ziv compressed strings1995
- A text compression scheme that allows fast searching directly in the compressed fileLecture Notes in Computer Science, 1994
- Efficient pattern matching with scalingJournal of Algorithms, 1992
- A Technique for High-Performance Data CompressionComputer, 1984
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977
- Efficient string matchingCommunications of the ACM, 1975