[图书][B] String searching algorithms
GA Stephen - 1994 - books.google.com
String searching is a subject of both theoretical and practical interest in computer science.
This book presents a bibliographic overview of the field and an anthology of detailed …
This book presents a bibliographic overview of the field and an anthology of detailed …
High performance string matching algorithm for a network intrusion prevention system (nips)
Y Weinsberg, S Tzur-David, D Dolev… - 2006 Workshop on …, 2006 - ieeexplore.ieee.org
Intrusion detection systems (IDS) were developed to identify and report attacks in the late
1990s, as hacker attacks and network worms began to affect the Internet. Traditional IDS …
1990s, as hacker attacks and network worms began to affect the Internet. Traditional IDS …
[HTML][HTML] Fast string matching for DNA sequences
In this paper we propose the Maximal Average Shift (MAS) algorithm that finds a pattern
scan order that maximizes the average shift length. We also present two extensions of MAS …
scan order that maximizes the average shift length. We also present two extensions of MAS …
String matching with multicore CPUs: Performing better with the Aho-Corasick algorithm
S Arudchutha, T Nishanthy… - 2013 IEEE 8th …, 2013 - ieeexplore.ieee.org
Multiple string matching is known as locating all the occurrences of a given number of
patterns in an arbitrary string. It is used in bio-computing applications where the algorithms …
patterns in an arbitrary string. It is used in bio-computing applications where the algorithms …
[PDF][PDF] The performance of single-keyword and multiple-keyword pattern matching algorithms
BW Watson - 1994 - research.tue.nl
This paper presents a toolkit of pattern matching algorithms, performance data on the
algorithms, and recommendations for the selection of an algorithm (given a particular …
algorithms, and recommendations for the selection of an algorithm (given a particular …
A taxonomy of sublinear multiple keyword pattern matching algorithms
BW Watson, G Zwaan - Science of Computer Programming, 1996 - Elsevier
This article presents a taxonomy of sublinear keyword pattern matching algorithms related to
the Boyer-Moore algorithm [3] and the Commentz-Walter algorithm [5, 6]. The taxonomy …
the Boyer-Moore algorithm [3] and the Commentz-Walter algorithm [5, 6]. The taxonomy …
Decompression-free inspection: Dpi for shared dictionary compression over http
A Bremler-Barr, ST David, D Hay… - 2012 Proceedings IEEE …, 2012 - ieeexplore.ieee.org
Deep Packet Inspection (DPI) is the most time and resource consuming procedure in
contemporary security tools such as Network Intrusion Detection/Prevention System …
contemporary security tools such as Network Intrusion Detection/Prevention System …
[图书][B] Constructing minimal acyclic deterministic finite automata
BW Watson - 2010 - search.proquest.com
This thesis is submitted in partial fulfillment of the requirements for the degree of Doctor of
Philosophy (Ph. D) in the FASTAR group of the Department of Computer Science, University …
Philosophy (Ph. D) in the FASTAR group of the Department of Computer Science, University …
A Boyer–Moore-style algorithm for regular expression pattern matching
BW Watson, RE Watson - Science of Computer Programming, 2003 - Elsevier
This paper presents a Boyer–Moore-type algorithm for regular expression pattern matching,
answering an open problem posed by Aho in 1980 (Pattern Matching in Strings, Academic …
answering an open problem posed by Aho in 1980 (Pattern Matching in Strings, Academic …
Spare parts: a C++ toolkit for string pattern recognition
BW Watson, L Cleophas - Software: Practice and Experience, 2004 - Wiley Online Library
In this paper, we consider the design and implementation of SPARE Parts, a C++ toolkit for
pattern matching. SPARE Parts (in particular, the 2003 version presented in this article) is …
pattern matching. SPARE Parts (in particular, the 2003 version presented in this article) is …