English

Computing q-gram Frequencies on Collage Systems

Data Structures and Algorithms 2011-07-18 v1

Abstract

Collage systems are a general framework for representing outputs of various text compression algorithms. We consider the all qq-gram frequency problem on compressed string represented as a collage system, and present an O((q+hlogn)n)O((q+h\log n)n)-time O(qn)O(qn)-space algorithm for calculating the frequencies for all qq-grams that occur in the string. Here, nn and hh are respectively the size and height of the collage system.

Keywords

Cite

@article{arxiv.1107.3019,
  title  = {Computing q-gram Frequencies on Collage Systems},
  author = {Keisuke Goto and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda},
  journal= {arXiv preprint arXiv:1107.3019},
  year   = {2011}
}
R2 v1 2026-06-21T18:37:22.391Z