Approximate string matching on Ziv–Lempel compressed text
- 30 June 2003
- journal article
- Published by Elsevier BV in Journal of Discrete Algorithms
- Vol. 1 (3-4), 313-338
- https://doi.org/10.1016/s1570-8667(03)00032-7
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A guided tour to approximate string matchingACM Computing Surveys, 2001
- Fast and flexible word searching on compressed textACM Transactions on Information Systems, 2000
- A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed TextLecture Notes in Computer Science, 1999
- A fast bit-vector algorithm for approximate string matching based on dynamic programmingJournal of the ACM, 1999
- Faster Approximate String MatchingAlgorithmica, 1999
- String Matching in Lempel—Ziv Compressed StringsAlgorithmica, 1998
- 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
- An Improved Algorithm For Approximate String MatchingSIAM Journal on Computing, 1990
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952