Let sleeping files lie: Pattern matching in Z-compressed files.
DOI10.1006/JCSS.1996.0023zbMATH Open1152.68436OpenAlexW2133248397WikidataQ59831028 ScholiaQ59831028MaRDI QIDQ960470FDOQ960470
Amihood Amir, Martin Farach, G. Benson
Publication date: 21 December 2008
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1996.0023
Recommendations
Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cited In (34)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Engineering Practical Lempel-Ziv Tries
- Title not available (Why is that?)
- Fast searching in packed strings
- Collage system: A unifying framework for compressed pattern matching.
- Random Access to Grammar-Compressed Strings and Trees
- An experimental study of a compressed index
- Compressed matching in dictionaries
- Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition
- Practical and flexible pattern matching over Ziv-Lempel compressed text.
- Fast distance multiplication of unit-Monge matrices
- Forty Years of Text Indexing
- Title not available (Why is that?)
- On the complexity of pattern matching for highly compressed two-dimensional texts.
- A faster algorithm for the computation of string convolutions using LZ78 parsing
- Speeding up HMM decoding and training by exploiting sequence repetitions
- Approximate string matching on Ziv--Lempel compressed text
- A fully compressed algorithm for computing the edit distance of run-length encoded strings
- MODELING DELTA ENCODING OF COMPRESSED FILES
- Practical fixed length Lempel-Ziv coding
- A RUN-TIME EFFICIENT IMPLEMENTATION OF COMPRESSED PATTERN MATCHING AUTOMATA
- Direct merging of delta encoded files
- Fast Searching in Packed Strings
- Title not available (Why is that?)
- Orthogonal Range Searching for Text Indexing
- A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS
- Unified compression-based acceleration of edit-distance computation
- Regular expression searching on compressed text
- A Run-Time Efficient Implementation of Compressed Pattern Matching Automata
- Pattern Matching in DCA Coded Text
- String matching over compressed text on handheld devices using tagged sub-optimal code (TSC)
- Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
- Title not available (Why is that?)
This page was built for publication: Let sleeping files lie: Pattern matching in Z-compressed files.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960470)
