Compressed and fully compressed pattern matching in one and two dimensions

W. Rytter
2000 Proceedings of the IEEE  
We survey the complexity issues related to several algorithmic problems for compressed and fully compressed pattern matching in one-and two-dimensional texts without explicit decompression. Several related problems for compressed strings and arrays are considered: equality testing, computation of regularities, subsegment extraction, language membership, and solvability of word equations.
doi:10.1109/5.892712 fatcat:qvrrcihiq5bljhcegk4oxpspzi