169 search results - page 10 / 34 » Pattern Matching in Text Compressed by Using Antidictionarie... |
RSA
2002
13 years 7 months ago
2002
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
ENC
2005
IEEE
14 years 1 months ago
2005
IEEE
We describe a compression technique for semistructured documents, called SCMPPM, which combines the Prediction by Partial Matching technique with Structural Contexts Model (SCM) t...
CPM
1993
Springer
13 years 11 months ago
1993
Springer
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
CSB
2002
IEEE
14 years 13 days ago
2002
IEEE
-- We investigate off-line dictionary oriented approaches to DNA sequence compression, based on the Burrows-Wheeler Transform (BWT). The preponderance of short repeating patterns i...
BIRD
2008
Springer
13 years 9 months ago
2008
Springer
The swap matching problem consists if finding a pattern in a text, while allowing for transpositions in the pattern. A new approach using a graph-theoretic model was presented in [...