15 search results - page 2 / 3 » Fast pattern-matching on indeterminate strings |
LATIN
1998
Springer
13 years 9 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
CPM
1999
Springer
13 years 9 months ago
1999
Springer
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
ANCS
2005
ACM
13 years 11 months ago
2005
ACM
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packe...
MST
2006
13 years 5 months ago
2006
In the late eighties, it was shown that juggling patterns can be described by strings of numbers with fascinating combinatorial properties that have since then been studied by man...
CPM
2000
Springer
13 years 9 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...