Boyer—Moore String Matching over Ziv-Lempel Compressed Text
Authors:
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 166-180
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Multiple pattern matching in LZW compressed text2002
- Approximate String Matching over Ziv—Lempel Compressed Text2000
- String Matching in Lempel—Ziv Compressed StringsAlgorithmica, 1998
- Pattern Matching Algorithms1997
- A text compression scheme that allows fast searching directly in the compressed fileACM Transactions on Information Systems, 1997
- Let Sleeping Files Lie: Pattern Matching in Z-Compressed FilesJournal of Computer and System Sciences, 1996
- Efficient algorithms for Lempel-Ziv encoding1996
- Practical fast searching in stringsSoftware: Practice and Experience, 1980
- A fast string searching algorithmCommunications of the ACM, 1977
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952