In computer science Compressed Pattern Matching or CPM is the process of searching for pattern in a compressed file without decompression. Searching in a compressed string is faster than searching an uncompressed string and requires less space.
| Property | Value |
|---|
| dbpprop:abstract
|
- In computer science Compressed Pattern Matching or CPM is the process of searching for pattern in a compressed file without decompression. Searching in a compressed string is faster than searching an uncompressed string and requires less space.
|
| dbpprop:date
| |
| dbpprop:reference
| |
| dbpprop:wikiPageUsesTemplate
| |
| rdfs:comment
|
- In computer science Compressed Pattern Matching or CPM is the process of searching for pattern in a compressed file without decompression. Searching in a compressed string is faster than searching an uncompressed string and requires less space.
|
| rdfs:label
|
- Compressed pattern matching
|
| skos:subject
| |
| foaf:page
| |
| is dbpprop:redirect
of | |
![[RDF Data]](/statics/sw-cube.png)
