Improved Bidirectional Exact Pattern Matching

Abstract

In this research, we present an improved version of Bidirectional (BD) exact pattern matching (EPM) algorithm to solve the problem of exact pattern matching. Improved-Bidirectional (IBD) exact pattern matching algorithm introduced a new idea of scanning partial text window (PTW) as well with the pattern to take decision of moving pattern to the right of partial text window. IBD algorithm compares the characters of pattern to selected text window (STW) from both sides simultaneously as BD. The time complexity of preprocessing phase of IBD algorithm is O(2m) and searching phase takes O(mn/2).