Compressed pattern matching
Encyclopedia
In computer science
Compressed Pattern Matching or CPM is the process of searching for pattern in compressed data with little or no decompression. Searching in a compressed string is faster than searching an uncompressed string and requires less space.
Computer science
Computer science or computing science is the study of the theoretical foundations of information and computation and of practical techniques for their implementation and application in computer systems...
Compressed Pattern Matching or CPM is the process of searching for pattern in compressed data with little or no decompression. Searching in a compressed string is faster than searching an uncompressed string and requires less space.
External links
- Almost optimal fully LZW-compressed pattern matching
- A Dictionary-based Compressed Pattern Matching Algorithm
- A unifying framework for compressed pattern matching
- Speeding Up String Pattern Matching by Text Compression: The Dawn of a New Era
- Shift-and approach to pattern matching in LZW compressed text