International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 140 - Issue 9 |
Published: April 2016 |
Authors: G.L. Prajapati, Abhijeet Singh Rathore, Bhavana Tanwar, Surbhi Bhadviy, Tushar Jain |
![]() |
G.L. Prajapati, Abhijeet Singh Rathore, Bhavana Tanwar, Surbhi Bhadviy, Tushar Jain . Performance Analysis of Selected String Matching Algorithms based on Good Suffix and Bad Character Rule. International Journal of Computer Applications. 140, 9 (April 2016), 28-37. DOI=10.5120/ijca2016909445
@article{ 10.5120/ijca2016909445, author = { G.L. Prajapati,Abhijeet Singh Rathore,Bhavana Tanwar,Surbhi Bhadviy,Tushar Jain }, title = { Performance Analysis of Selected String Matching Algorithms based on Good Suffix and Bad Character Rule }, journal = { International Journal of Computer Applications }, year = { 2016 }, volume = { 140 }, number = { 9 }, pages = { 28-37 }, doi = { 10.5120/ijca2016909445 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2016 %A G.L. Prajapati %A Abhijeet Singh Rathore %A Bhavana Tanwar %A Surbhi Bhadviy %A Tushar Jain %T Performance Analysis of Selected String Matching Algorithms based on Good Suffix and Bad Character Rule%T %J International Journal of Computer Applications %V 140 %N 9 %P 28-37 %R 10.5120/ijca2016909445 %I Foundation of Computer Science (FCS), NY, USA
String matching is a problem where a pattern is to be searched within a text. In this paper, we study about selected string matching algorithms which compute shifts; based on good suffix rule and/or bad character rule or their variations. Algorithms are compared on the basis of their execution time for different data sets; those differ on patterns and alphabet sizes. Finally, we present a summary for the selection of these algorithms in different applications, based on the experimental results obtained.