FINDING CHARACTERISTIC SUBSTRINGS FROM COMPRESSED TEXTS

DOI10.1142/S0129054112400126zbMath1302.68339OpenAlexW2295740354MaRDI QIDQ2909195

Hideo Bannai, Shunsuke Inenaga

Publication date: 30 August 2012

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

Full work available at URL: https://doi.org/10.1142/s0129054112400126

zbMATH Keywords

straight-line programstext compressionpolynomial-time algorithmsstring data mining

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20) Algorithms on strings (68W32)

Related Items (1)

Access, Rank, and Select in Grammar-compressed Strings

Cites Work

• Efficient algorithms to compute compressed longest common substrings and compressed palindromes
• Discovering characteristic expressions in literary works.
• 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

This page was built for publication: FINDING CHARACTERISTIC SUBSTRINGS FROM COMPRESSED TEXTS