Compressed pattern matching
From Wikipedia, the free encyclopedia
 |
This article may need to be wikified to meet Wikipedia's quality standards. Please help by adding relevant internal links, or by improving the article's layout. (January 2011)
Click [show] on right for more details.
No reason has been cited for the Wikify tag on this article.
|
 |
This article needs attention from an expert on the subject. See the talk page for details. WikiProject Computer science or the Computer science Portal may be able to help recruit an expert. (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.
Contents |
[edit] Approximate CPM
 |
This section is empty. You can help by adding to it. |
[edit] Multi-Pattern CPM
![[icon]](/wiki/File:Wiki_letter_w_cropped.svg){kind=small} |
This section requires expansion. |
[edit] Aho-Corasick technique
|
This section is empty. You can help by adding to it. |
[edit] Boyer-Moore technique
|
This section is empty. You can help by adding to it. |
[edit] Bit parallel technique
|
This section is empty. You can help by adding to it. |
[edit] References
[edit] 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. |
