An Improved Pattern Matching Algorithm Based on BMHS

Yuan, Jinsha; Yang, Jinsong; Ding, Shunli

doi:10.1109/dcabes.2012.115

Cited by 6 publications

(4 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 2010, the BMHS2 was proposed which aims to address the shortcomings of the BMHS algorithm [9]. In addition, another BMHS improvement was proposed that takes advantage of the position information of the last character and its adjacent character in the current attempt window to get a bigger jump distance in each jump in order to make the algorithm more efficient [10].…”

Section: The Traditional Boyer-moore Algorithmmentioning

confidence: 99%

A Study of a Local Search Engine for Desktop PCs using an Enhanced Boyer-Moore Algorithm

Sernicula,

Manalo,

Niebre

et al. 2019

JITC

View full text Add to dashboard Cite

The volume of digital information and documents stored on desktop computers and over the Internet has been rapidly increasing in the past few years. Thus, search algorithms, methods, and programs are becoming popular to help in finding the intended information or files. This study proposes a string-matching algorithm to improve the pattern-matching technique of the traditional Boyer-Moore (BM) search algorithm. The proposed enhanced BM algorithm simultaneously scans the text from both sides (left and right) using two windows wherein each window has a size that is equal to the pattern length.

show abstract

Section: The Traditional Boyer-moore Algorithmmentioning

confidence: 99%

A Study of a Local Search Engine for Desktop PCs using an Enhanced Boyer-Moore Algorithm

Sernicula,

Manalo,

Niebre

et al. 2019

JITC

View full text Add to dashboard Cite

show abstract

“…In BM algorithm the concept of good-suffix and bad character is used to calculate jump for skipping of characters in case of mismatch. In BMH algorithm a character of text corresponding to last character of pattern is used to calculate jump [5,6,7,10,11]. The BMHS algorithm uses next-tolast character for calculating jump as a bad character rule.…”

Section: Introductionmentioning

confidence: 99%

Performance Improvement of BMH and BMHS using PDJ (Possible Double Jump) and MValue (Match Value)

Rasool¹,

Khare²

2013

IJCA

View full text Add to dashboard Cite

BM (Boyer-Moore) string matching algorithm and its enhanced versions like BMH and BMHS are a standard benchmark for single pattern string matching. Based on BMH and BMHS algorithms we have developed improved algorithms EBMH(Enhanced BMH)and EBMHS(Enhanced BMHS). These algorithms uses the newly introduced PDJ (possible double jump) and MValue(Match Value) concepts. While searching these concepts helps to provide longer jump of characters. The algorithm EBMH emphasize on BMH algorithm with the inclusion of PDJ and MValue and the algorithm EBMHS emphasize on BMHS algorithm with the inclusion of PDJ and MValue. Through these algorithm the number of comparison of characters between text and pattern are reduced to a significant amount. In this paper PDJ, MValue, EBMH and EBMHS are described and analyzed. Experimental results show that in the algorithms searching time is reduced as compared to BM, BMH, and BMHS. The algorithms are analyzed on the basis of time requirement in best, worst and average case.

show abstract

“…JingboYoun, Jinsong Yang and Shunli Ding by analyzing and comparing above several algorithms proposed based on BHMS an improved version of BHMS that is come to known as improved BHMS(IBHMS) algorithm in 11th international symposium on distributed computing and application to business, Engineering &Science in 2012 [15]. The proposed improved BHMS algorithm perform matching from right to left and if any mismatch occurs, then this algorithm calculate rightmost shift distance of pattern P and do accordingly.…”

Section: Improved Bhms Algorithmsmentioning

confidence: 99%

“…Horspool noted the bad character shift was usually the longest shift and considered a medication that allows us to omit the second more complex shift table. Horspool proposed Boyer-Moore-Horspool algorithm in 1980 [12,15] This is a simplified form of the Boyer-Moore algorithm, whole matching process is same as BM algorithm the only difference is BMH algorithm uses only bad-character shift skip good suffix table because pre-processing good suffix rule is tough thus . BMH algorithm is the best in terms of average case performance for all alphabet sizes and almost all pattern lengths.…”

Section: Boyer-moore-horspool (Bmh) Algorithmmentioning

confidence: 99%

Feasible Study on Pattern Matching Algorithms based on Intrusion Detection Systems

Tiwari¹,

Motwani²

2014

IJCA

View full text Add to dashboard Cite

With the increasing popularity of web services, attackers are paying more attention to hack the web services and the servers on which they run. Thus the need of effective modern intrusion detection system has taken prime importance for any system. At present intrusion detection system (IDS) analysis module uses the pattern matching technology, which is applied in various problems in the field of information security, genetic algorithms and evolutionary algorithm. As one of the solution to intrusion detection problems, pattern matching algorithms shown their advantages. This paper presents a feasibility study on a pattern matching algorithm General TermsIntrusion Detection System (IDS), Pattern matching algorithm.

show abstract

An Improved Pattern Matching Algorithm Based on BMHS

Cited by 6 publications

References 4 publications

A Study of a Local Search Engine for Desktop PCs using an Enhanced Boyer-Moore Algorithm

A Study of a Local Search Engine for Desktop PCs using an Enhanced Boyer-Moore Algorithm

Performance Improvement of BMH and BMHS using PDJ (Possible Double Jump) and MValue (Match Value)

Feasible Study on Pattern Matching Algorithms based on Intrusion Detection Systems

Contact Info

Product

Resources

About