Compressed pattern matching
 | Template:Wikify is deprecated. Please use a more specific cleanup template as listed in the documentation. |
 | 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. (March 2009) |
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.
Approximate CPM
![[icon]](/wiki/File:Wiki_letter_w_cropped.svg?lang=en){kind=small} | This section is empty. You can help by adding to it. (March 2009) |
Multi-Pattern CPM
| This section needs expansion. You can help by adding to it. (March 2009) |
Aho-Corasick technique
| This section is empty. You can help by adding to it. (January 2011) |
Boyer-Moore technique
| This section is empty. You can help by adding to it. (January 2011) |
Bit parallel technique
| This section is empty. You can help by adding to it. (January 2011) |
References
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
 | This computer science article is a stub. You can help Wikipedia by expanding it. |