Let sleeping files lie: Pattern matching in Z-compressed files.

DOI10.1006/JCSS.1996.0023MaRDI QIDQ960470zbMATH OpenOpenAlexWikidataFDO

Authors Amihood Amir, G. Benson, Martin Farach

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

zbMATH Keywords

compressed matchingalgorithm's time complexity

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 1003304
• scientific article; zbMATH DE number 1998342
• Practical and flexible pattern matching over Ziv-Lempel compressed text.
• scientific article; zbMATH DE number 2185629
• Pattern matching in compressed texts

Cited in

(38)

• scientific article; zbMATH DE number 1418326 (Why is no real title available?)
• Pattern matching in compressed texts and images
• scientific article; zbMATH DE number 1839439 (Why is no real title available?)
• Fast searching in packed strings
• scientific article; zbMATH DE number 1998342 (Why is no real title available?)
• Towards approximate matching in compressed strings: local subsequence recognition
• scientific article; zbMATH DE number 7765421 (Why is no real title available?)
• Collage system: A unifying framework for compressed pattern matching.
• Compressed matching in dictionaries
• An experimental study of a compressed index
• Processing of Huffman compressed texts with a super-alphabet.
• Practical and flexible pattern matching over Ziv-Lempel compressed text.
• Fast distance multiplication of unit-Monge matrices
• Forty Years of Text Indexing
• scientific article; zbMATH DE number 1629861 (Why is no real title available?)
• Engineering practical Lempel-Ziv tries
• Compressed parameterized pattern matching
• Random access to grammar-compressed strings and trees
• Orthogonal range searching for text indexing
• 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
• scientific article; zbMATH DE number 2185630 (Why is no real title available?)
• Unified compression-based acceleration of edit-distance computation
• Regular expression searching on compressed text
• A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS
• A Run-Time Efficient Implementation of Compressed Pattern Matching Automata
• Pattern matching in compressed texts
• 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

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)