 
Summary: Inplace RunLength 2d Compressed Search
Amihood Amir \Lambda Gad M. Landau y Dina Sokol z
1 Introduction
Recent developments in multimedia have led to a vast
increase in the amount of stored data. This increase
has made it critically important to store and transmit
files in a compressed form. The need to quickly access
this data has given rise to a new paradigm in searching,
that of compressed matching [1, 5, 6]. In traditional
pattern matching, the pattern (P ) and text (T ) are
explicitly given, and all occurrences of P in T are
sought. In compressed pattern matching the goal is
the same, however, the pattern and text are given in
compressed form. Let c be a compression algorithm,
and let c(D) be the result of c compressing data D. A
compressed matching algorithm is optimal if its time
complexity is O(c(T ) + c(P )).
Although optimality in terms of time is always impor
tant, when dealing with compression, the criterion of
extra space is equally important. In many applica
