The Boyer–Moore–Galil String Searching Strategies Revisited

Apostolico, Alberto; Giancarlo, Raffaele

doi:10.1137/0215007

Cited by 124 publications

(74 citation statements)

References 8 publications

(8 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In 1986, Apostolico and Giancarlo developed a variant of Boyer-Moore algorithm that requires at most 2n comparisons, but requires O(m) additional space [19,15,8]. In 1996, Crochemore and Lecroq showed that the Apostolico-Giancarlo algorithm has a tight bound of at most 1.5n comparisons [20].…”

Section: Performance Analysis Of Bmmentioning

confidence: 99%

Applying Fast String Matching to Intrusion Detection

Fisk¹,

Varghese²

2002

View full text Add to dashboard Cite

Abstract. The performance of signature-based network intrusion detection tools is dominated by the string matching of packets against many signatures. In this paper we study how the popular intrusion detecton system Snort can be best optimized to utilize different string matching algorithms. We analyze the performance of Snort's current string matching algorithm, Boyer-Moore, and several alternate algorithms. We show that no single algorithm is fastest in the context of a real Snort rule set. Instead, we develop a hybrid system that utilizes three different search algorithms, including one new algorithm presented in this paper. The result is a system that matches many common packets 5 times faster with an average speedup of 50%. While the context of our analysis is intrusion detection, other problem domains such as virus scanning, firewalls, and layer seven switches benefit from our work.

show abstract

Section: Performance Analysis Of Bmmentioning

confidence: 99%

Applying Fast String Matching to Intrusion Detection

Fisk¹,

Varghese²

2002

View full text Add to dashboard Cite

show abstract

“…Other representative papers about string-search are [2,5,22]. Some works also deal with the problem of searching approximate patterns [24,13].…”

Section: Related Workmentioning

confidence: 99%

Efficient evaluation of parameterized pattern queries

Mouza

Rigaux

Scholl

2005

Proceedings of the 14th ACM International Conference on Information and Knowledge Management

View full text Add to dashboard Cite

Many applications rely on sequence databases and use extensively pattern-matching queries to retrieve data of interest. This paper extends the traditional pattern-matching expressions to parameterized patterns, featuring variables. Parameterized patterns are more expressive and allow to define concisely regular expressions that would be very complex to describe without variables. They can also be used to express additional constraints on patterns' variables.We show that they can be evaluated without additional cost with respect to traditional techniques (e.g., the KnuthMorris-Pratt algorithm). We describe an algorithm that enjoys low memory and CPU time requirements, and provide experimental results which illustrate the gain of the optimized solution.

show abstract

“…Therefore, well-known string matching algorithms such as KMP string matching method [5] or Boyer-Moore-Galil string matching method [6] could be used as the comparator.…”

Section: Signature Pattern Recognition By Using String Matchingmentioning

confidence: 99%

Efficient Signature Pattern Generation by Using Latticed Bounding Box

Jihyeon¹,

Jung²,

Jung³

2017

csit

View full text Add to dashboard Cite

According to the growth of users' needs for security and human-machine interaction, many automated user verification method have been developed based on biometrics. One of the representative methods among them is on-line signature recognition. But, the previous on-line signature recognition methods require too much complex processing so that it is not well suited for the simple and fast processing application. In this paper, we deals with efficient signature pattern generation method by using the relatively adjustable latticed bounding box to make more efficient signature recognition for various human-machine interactions.

show abstract

The Boyer–Moore–Galil String Searching Strategies Revisited

Cited by 124 publications

References 8 publications

Applying Fast String Matching to Intrusion Detection

Applying Fast String Matching to Intrusion Detection

Efficient evaluation of parameterized pattern queries

Efficient Signature Pattern Generation by Using Latticed Bounding Box

Contact Info

Product

Resources

About