Multidimensional Compressed Pattern Matching

Problem Definition Let c be a given compression algorithm, and let c(D) be the result of c compressing data D. The compressed search problem with compression algorithm c is defined as follows. INPUT: Compressed text c(T) and pattern P.OUTPUT: All locations in T where pattern P occurs. INPUT: Compressed text c(T) and pattern P.OUTPUT: All locations in T where pattern P occurs. A compressed matching algorithm is optimal if its time complexity is O(|c(T)|)O(|c(T)|). Although optimality in terms of time is always important, when dealing with compression, the criterion of extra space is perhaps more important [20]. Applications employ compression techniques specifically because there is a limited amount of available space. Thus, it is not sufficient for a compressed matching algorithm to be optimal in ter ...