CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Performance Analysis of Selected String Matching Algorithms based on Good Suffix and Bad Character Rule

by G.L. Prajapati, Abhijeet Singh Rathore, Bhavana Tanwar, Surbhi Bhadviy, Tushar Jain
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 140 - Number 9
Year of Publication: 2016
Authors: G.L. Prajapati, Abhijeet Singh Rathore, Bhavana Tanwar, Surbhi Bhadviy, Tushar Jain
10.5120/ijca2016909445

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 },
issue_date = { April 2016 },
volume = { 140 },
number = { 9 },
month = { April },
year = { 2016 },
issn = { 0975-8887 },
pages = { 28-37 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume140/number9/24623-2016909445/ },
doi = { 10.5120/ijca2016909445 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:42:13.100766+05:30
%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
%J International Journal of Computer Applications
%@ 0975-8887
%V 140
%N 9
%P 28-37
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. Boyer R.S., Moore J.S., 1977, a fast string searching algorithm. Communications of the ACM. 20:762­772.
  2. Aho, A.V., 1990, Algorithms for finding patterns in strings. in Handbook of Theoretical Computer Science, Volume A, Algorithms and complexity, J. van Leeuwen ed., Chapter 5, pp 255­300, Elsevier, Amsterdam.
  3. Crochemore, M., 1997. Off­line serial exact string searching, in Pattern Matching Algorithms, ed. A. Apostolico and Z. Galil, Chapter 1, pp 1­53, Oxford University Press.
  4. Zhu R.F., Takaoka T., 1987, on improving the average case of the Boyer­Moore string matching algorithm, Journal of Information Processing 10(3):173­177.
  5. Smith P.D., 1991, Experiments with a very fast substring search algorithm, Software Practice & Experience 21(10):1065­1074.
  6. Horspool R.N., 1980, Practical fast searching in strings, Software ­ Practice & Experience, 10(6):501­506.
  7. Sunday D.M., 1990, a very fast substring search algorithm, Communications of the ACM. 33(8):132­142
  8. The SMART tool used for execution of algorithms can be found at: http://www.dmi.unict.it/~faro/smart/.
Index Terms

Computer Science
Information Sciences

Keywords

Good Suffix Rule Bad Character Rule Boyer Moore Variations String Matching Problem Performance Analysis.

Powered by PhDFocusTM