Pattern matching in text compressed with the ID heuristic

Abstract

We show an O(m+t) space algorithm to find all the occurrences of a pattern in a text compressed with the ID heuristic that runs in time O(n(m+t)), where m is the pattern length, n is the size of the compressed text and 1 is the maximum target length.