Compressed pattern matching
 | This article needs attention from an expert in Computer Science. Please add a reason or a talk parameter to this template to explain the issue with the article. |
In computer science Compressed Pattern Matching or CPM is the process of searching for pattern in a compressed file without decompression.
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
 | This computer science article is a stub. You can help Wikipedia by expanding it. |