International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 143 - Issue 11 |
Published: Jun 2016 |
Authors: Grishma Pandey, G. L. Prajapati |
![]() |
Grishma Pandey, G. L. Prajapati . Applying Bi-Directional Search Strategy in Selected String Matching Algorithms. International Journal of Computer Applications. 143, 11 (Jun 2016), 40-43. DOI=10.5120/ijca2016910474
@article{ 10.5120/ijca2016910474, author = { Grishma Pandey,G. L. Prajapati }, title = { Applying Bi-Directional Search Strategy in Selected String Matching Algorithms }, journal = { International Journal of Computer Applications }, year = { 2016 }, volume = { 143 }, number = { 11 }, pages = { 40-43 }, doi = { 10.5120/ijca2016910474 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2016 %A Grishma Pandey %A G. L. Prajapati %T Applying Bi-Directional Search Strategy in Selected String Matching Algorithms%T %J International Journal of Computer Applications %V 143 %N 11 %P 40-43 %R 10.5120/ijca2016910474 %I Foundation of Computer Science (FCS), NY, USA
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.