Sciweavers

15 search results - page 1 / 3
» Fast pattern-matching on indeterminate strings
Sort
View
67
Voted
STRINGOLOGY
2008
15 years 2 months ago
An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings
William F. Smyth, Shu Wang, Mao Yu
109
Voted
CORR
2011
Springer
198views Education» more  CORR 2011»
14 years 7 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
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...
Pawel Gawrychowski
77
Voted
JDA
2008
57views more  JDA 2008»
15 years 19 days ago
Fast pattern-matching on indeterminate strings
Jan Holub, William F. Smyth, Shu Wang
121
Voted
JSAC
2006
163views more  JSAC 2006»
15 years 18 days ago
Fast and Scalable Pattern Matching for Network Intrusion Detection Systems
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....
Sarang Dharmapurikar, John W. Lockwood
CPM
2005
Springer
123views Combinatorics» more  CPM 2005»
15 years 6 months ago
A Simple Fast Hybrid Pattern-Matching Algorithm
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...
Frantisek Franek, Christopher G. Jennings, William...