254 search results - page 15 / 51 » Multiple Approximate String Matching |
122
click to vote
JCB
2008
15 years 2 months ago
2008
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...
123
click to vote
JSAC
2006
15 years 2 months ago
2006
The ability to inspect both packet headers and payloads to identify attack signatures makes network intrusion detection system (NIDS) a promising approach to protect Internet syste...
129
click to vote
ISMB
1998
15 years 3 months ago
1998
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
116
Voted
FPL
2003
Springer
15 years 7 months ago
2003
Springer
Intrusion Detection Systems such as Snort scan incoming packets for evidence of security threats. The most computation-intensive part of these systems is a text search against hund...
97
Voted
JDA
2007
15 years 2 months ago
2007
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...