Performance Analysis of Selected String Matching Algorithms based on Good Suffix and Bad Character Rule
Gend Lal Prajapati, Abhijeet Singh, Bhavana Tanwar, Surbhi Bhadviy, Tushar Jain · International Journal of Computer Applications · 2016
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.