134 search results - page 6 / 27 » A Boyer-Moore Type Algorithm for Compressed Pattern Matching |
APPROX
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
DCC
2006
IEEE
14 years 10 months ago
2006
IEEE
We propose a new sequential, adaptive, quadratic-time algorithm for variable-rate lossy compression of memoryless sources at a fixed distortion. The algorithm uses approximate pat...
CPM
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
WEA
2007
Springer
14 years 4 months ago
2007
Springer
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
CPM
1993
Springer
14 years 2 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 ...