Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts
From MaRDI portal
Publication:2891377
DOI10.1007/978-3-642-27660-6_25zbMath1302.68338arXiv1107.3022OpenAlexW1607899610MaRDI QIDQ2891377
Masayuki Takeda, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai
Publication date: 15 June 2012
Published in: SOFSEM 2012: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.3022
Analysis of algorithms and problem complexity (68Q25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- Data structures and algorithms for the string statistics problem
- Compressed representations of sequences and full-text indexes
- Processing Compressed Texts: A Tractability Border
- Fast Pattern Matching in Strings
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Random Access to Grammar-Compressed Strings and Trees
This page was built for publication: Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts
