A general compression algorithm that supports fast searching

DOI10.1016/J.IPL.2006.04.020MaRDI QIDQ845872zbMATH OpenOpenAlexFDO

Authors Kimmo Fredriksson, Szymon Grabowski

Publication date 29 January 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2006.04.020

zbMATH Keywords

algorithmscompression\(q\)-gramssearching in compressed text

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites work

• scientific article; zbMATH DE number 1615279 (Why is no real title available?)
• scientific article; zbMATH DE number 2185628 (Why is no real title available?)
• scientific article; zbMATH DE number 1975048 (Why is no real title available?)
• scientific article; zbMATH DE number 1754502 (Why is no real title available?)
• scientific article; zbMATH DE number 2087042 (Why is no real title available?)
• scientific article; zbMATH DE number 742992 (Why is no real title available?)
• Efficient string matching
• Multiple approximate string matching
• Pattern matching in Huffman encoded texts
• Processing of Huffman compressed texts with a super-alphabet.
• Shift-or string matching with super-alphabets
• \((s,c)\)-dense coding: an optimized compression code for natural language text databases.

Cited in

(2)

• Improved characters distance sampling for online and offline text searching
• Efficient online string matching based on characters distance text sampling

This page was built for publication: A general compression algorithm that supports fast searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845872)