15 search results - page 1 / 3 » Fast pattern-matching on indeterminate strings |
STRINGOLOGY
2008
13 years 9 months ago
2008
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
JDA
2008
13 years 7 months ago
2008
JSAC
2006
13 years 7 months ago
2006
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 packets....
CPM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The Knuth-Morris-Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the...