A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS

DOI10.1142/S0129054105003728zbMath1082.68028MaRDI QIDQ5714664

Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga

Publication date: 15 December 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

text compressionstring processing

Mathematics Subject Classification ID

Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (1)

String Indexing with Compressed Patterns

Cites Work

• Let sleeping files lie: Pattern matching in Z-compressed files.
• Matching patterns in strings subject to multi-linear transformations
• String matching in Lempel-Ziv compressed strings
• Structured grammar-based codes for universal lossless data compression.
• Collage system: A unifying framework for compressed pattern matching.
• Data compression via textual substitution
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Universal lossless compression via multilevel pattern matching
• Grammar-based codes: a new class of universal lossless source codes

This page was built for publication: A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS