Let sleeping files lie: Pattern matching in Z-compressed files.
From MaRDI portal
Publication:960470
DOI10.1006/jcss.1996.0023zbMath1152.68436OpenAlexW2133248397WikidataQ59831028 ScholiaQ59831028MaRDI QIDQ960470
Amihood Amir, Martin Farach, Gary 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
Analysis of algorithms and problem complexity (68Q25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20)
Related Items (27)
On the complexity of pattern matching for highly compressed two-dimensional texts. ⋮ Collage system: A unifying framework for compressed pattern matching. ⋮ Speeding up HMM decoding and training by exploiting sequence repetitions ⋮ Practical and flexible pattern matching over Ziv-Lempel compressed text. ⋮ Engineering Practical Lempel-Ziv Tries ⋮ Unified compression-based acceleration of edit-distance computation ⋮ A fully compressed algorithm for computing the edit distance of run-length encoded strings ⋮ Unnamed Item ⋮ MODELING DELTA ENCODING OF COMPRESSED FILES ⋮ Compressed matching in dictionaries ⋮ Practical fixed length Lempel-Ziv coding ⋮ Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition ⋮ A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS ⋮ Fast searching in packed strings ⋮ Forty Years of Text Indexing ⋮ An experimental study of a compressed index ⋮ A Run-Time Efficient Implementation of Compressed Pattern Matching Automata ⋮ Direct merging of delta encoded files ⋮ Fast Searching in Packed Strings ⋮ A RUN-TIME EFFICIENT IMPLEMENTATION OF COMPRESSED PATTERN MATCHING AUTOMATA ⋮ A faster algorithm for the computation of string convolutions using LZ78 parsing ⋮ Regular expression searching on compressed text ⋮ Approximate string matching on Ziv--Lempel compressed text ⋮ Orthogonal Range Searching for Text Indexing ⋮ Random Access to Grammar-Compressed Strings and Trees ⋮ Fast distance multiplication of unit-Monge matrices ⋮ String matching over compressed text on handheld devices using tagged sub-optimal code (TSC)
This page was built for publication: Let sleeping files lie: Pattern matching in Z-compressed files.
