FINDING CHARACTERISTIC SUBSTRINGS FROM COMPRESSED TEXTS
From MaRDI portal
Publication:2909195
DOI10.1142/S0129054112400126zbMath1302.68339MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68T05: Learning and adaptive systems in artificial intelligence
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
68P20: Information storage and retrieval of data
68W32: Algorithms on strings
Related Items
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