Text compression
Fast text searching: allowing errors
Communications of the ACM
Text algorithms
Let sleeping files lie: pattern matching in Z-compressed files
Journal of Computer and System Sciences
A text compression scheme that allows fast searching directly in the compressed file
ACM Transactions on Information Systems (TOIS)
Pattern matching algorithms
Very fast and simple approximate string matching
Information Processing Letters
Fast and flexible word searching on compressed text
ACM Transactions on Information Systems (TOIS)
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Approximate String Matching over Ziv-Lempel Compressed Text
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Boyer-Moore String Matching over Ziv-Lempel Compressed Text
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Shift-And Approach to Pattern Matching in LZW Compressed Text
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Bit-Parallel Approach to Approximate String Matching in Compressed Texts
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Multiple Pattern Matching in LZW Compressed Text
DCC '98 Proceedings of the Conference on Data Compression
A sub-quadratic sequence alignment algorithm for unrestricted cost matrices
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate Matching of Run-Length Compressed Strings
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Multiple Pattern Matching Algorithms on Collage System
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
String Matching with Stopper Encoding and Code Splitting
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Regular Expression Searching over Ziv-Lempel Compressed Text
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Searching in Compressed Dictionaries
DCC '02 Proceedings of the Data Compression Conference
Path Matching in Compressed Control Flow Traces
DCC '02 Proceedings of the Data Compression Conference
Compressed Pattern Matching for Sequitur
DCC '01 Proceedings of the Data Compression Conference
Regular expression searching on compressed text
Journal of Discrete Algorithms
Approximate string matching on Ziv-Lempel compressed text
Journal of Discrete Algorithms
LZgrep: a Boyer–Moore string matching tool for Ziv–Lempel compressed text: Research Articles
Software—Practice & Experience
The design and evaluation of path matching schemes on compressed control flow traces
Journal of Systems and Software
Efficient String Matching in Huffman Compressed Texts
Fundamenta Informaticae
Extending autocompletion to tolerate errors
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
ACM Transactions on Algorithms (TALG)
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Random access to grammar-compressed strings
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Efficient String Matching in Huffman Compressed Texts
Fundamenta Informaticae
Speeding up HMM decoding and training by exploiting sequence repetitions
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Hi-index | 0.00 |
Abstract: Approximate string matching on compressed text was a problem open during almost a decade. The two existing solutions are very recent. Despite that they represent important complexity breakthroughs, in most practical cases they are not useful, in the sense that they are slower than uncompressing the text and then searching the uncompressed text. In this paper we present a different approach, which reduces the problem to multi-pattern searching of pattern pieces plus local decompression and direct verification of candidate text areas. We show experimentally that this solution is 10-30 times faster than previous work and up to three times faster than the trivial approach of uncompressing and searching, thus becoming the first practical solution to the problem.