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+hlog⁡n)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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.