Enhanced Pattern Matching Performance Using Improved Boyer Moore Horspool Algorithm
In computer science, the Boyer Moore Horspool algorithm is an algorithm for finding substrings in strings. A pattern matching problem can be classified into software and hardware based on implemental methods. It is important of enhance pattern matching performance. This paper proposes enhanced pattern matching performance using improved Boyer Moore Horspool Algorithm. It combines the deterministic finite state; the improved Boyer Moore Horspool Algorithm takes full use of the matching information to skip several characters. Experimental result shows that the proposed improved Boyer Moore Horspool Algorithm is effective.