A general compression algorithm that supports fast searching

DOI10.1016/j.ipl.2006.04.020zbMath1185.68324OpenAlexW2149801877MaRDI QIDQ845872

Szymon Grabowski, Kimmo Fredriksson

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)

Related Items (2)

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

Cites Work

• Shift-or string matching with super-alphabets
• Pattern matching in Huffman encoded texts
• Efficient string matching
• Multiple approximate string matching
• String Processing and Information Retrieval
• String Processing and Information Retrieval
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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