A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Applying Bi-Directional Search Strategy in Selected String Matching Algorithms
2016
International Journal of Computer Applications
String matching is an important problem in computer science having several practical applications. In this paper, we apply bi-directional searching mechanism in exact string matching algorithms: Boyer Moore, Brute Force, Knuth-Morris Pratt, and Rabin Karp. Experiments show that this strategy leads to better efficiency of these string matching algorithm. Keywords Boyer Moore Algorithm, Brute Force Algorithm, Knuth-Morris Pratt Algorithm, Rabin Karp Algorithm O(m+n) expected running time.
doi:10.5120/ijca2016910474
fatcat:zif5i6jlabgs5eprbtpgioxle4