Compressed pattern matching
- Compressed pattern matching
-
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
Multi-Pattern CPM
Aho-Corasick technique
Boyer-Moore technique
Bit parallel technique
References
External links
Wikimedia Foundation.
2010.
Look at other dictionaries:
Compressed suffix array — The Compressed Suffix Array[1][2] is a compressed data structure for pattern matching. Given a text T of n characters from an alphabet Σ, the compressed suffix array support searching for arbitrary patterns in T. For an input pattern P of m… … Wikipedia
Compressed data structure — The term compressed data structure arises in the computer science subfields of algorithms, data structures, and theoretical computer science. It refers to a data structure whose operations are roughly as fast as those of a conventional data… … Wikipedia
CPM — may refer to: Advertising cost per mille, the advert cost per thousand views Cost per impression, the online advert cost per thousand views M=1000 in roman numerals so CPM = C=Cost P=Per M=1,000 as in banner advertising you pay for each 1,000 ad… … Wikipedia
JBIG2 — is an image compression standard for bi level images, developed by the Joint Bi level Image Experts Group. It is suitable for both lossless and lossy compression. According to a press release [ [http://www.jpeg.org/public/mauijbig.pdf Press… … Wikipedia
Vector quantization — is a classical quantization technique from signal processing which allows the modeling of probability density functions by the distribution of prototype vectors. It was originally used for data compression. It works by dividing a large set of… … Wikipedia
Physical Sciences — ▪ 2009 Introduction Scientists discovered a new family of superconducting materials and obtained unique images of individual hydrogen atoms and of a multiple exoplanet system. Europe completed the Large Hadron Collider, and China and India took… … Universalium
Schwartz-Zippel lemma and testing polynomial identities — Polynomial identity testing is the problem of determining whether a given multivariate polynomial is the0 polynomial or identically equal to 0. The input to the problem is an n variable polynomial over a fieldF. It can occur in the following… … Wikipedia
Suffix tree — In computer science, a suffix tree (also called suffix trie, PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many… … Wikipedia
Grammar-based code — Grammar based codes are compression algorithms based on the idea of constructing a context free grammar for the string to be compressed. Examples include universal lossless data compression algorithms proposed in Kieffer and Yang 2000, and… … Wikipedia
Artificial intelligence — AI redirects here. For other uses, see Ai. For other uses, see Artificial intelligence (disambiguation). TOPIO, a humanoid robot, played table tennis at Tokyo International Robot Exhibition (IREX) 2009.[1] Artificial intelligence ( … Wikipedia
