Approximate String Matching over Ziv—Lempel Compressed Text
Authors:
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 195-209
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Multiple pattern matching in LZW compressed text2002
- Boyer—Moore String Matching over Ziv-Lempel Compressed Text2000
- Very fast and simple approximate string matchingInformation Processing Letters, 1999
- A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text1999
- Faster Approximate String MatchingAlgorithmica, 1999
- String Matching in Lempel—Ziv Compressed StringsAlgorithmica, 1998
- Pattern Matching Algorithms1997
- Let Sleeping Files Lie: Pattern Matching in Z-Compressed FilesJournal of Computer and System Sciences, 1996
- Approximate string matching and local similarityLecture Notes in Computer Science, 1994
- An Improved Algorithm For Approximate String MatchingSIAM Journal on Computing, 1990