54 search results - page 4 / 11 » Multiple Pattern Matching in LZW Compressed Text |
APPROX
2004
Springer
15 years 1 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
2010
IEEE
15 years 24 days ago
2010
IEEE
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
115
click to vote
WIA
2007
Springer
15 years 3 months ago
2007
Springer
The Boyer and Moore (BM) pattern matching algorithm is considered as one of the best, but its performance is reduced on binary data. Yet, searching in binary texts has important a...
CPM
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
SPIRE
2000
Springer
15 years 1 months ago
2000
Springer
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...