CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 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

A Novel String Matching Algorithm and Comparison with KMP Algorithm

by Garima Pandey, Mamta Martolia, Nitin Arora
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 179 - Number 3
Year of Publication: 2017
Authors: Garima Pandey, Mamta Martolia, Nitin Arora
10.5120/ijca2017915712

Garima Pandey, Mamta Martolia, Nitin Arora . A Novel String Matching Algorithm and Comparison with KMP Algorithm. International Journal of Computer Applications. 179, 3 ( Dec 2017), 6-8. DOI=10.5120/ijca2017915712

@article{ 10.5120/ijca2017915712,
author = { Garima Pandey, Mamta Martolia, Nitin Arora },
title = { A Novel String Matching Algorithm and Comparison with KMP Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { Dec 2017 },
volume = { 179 },
number = { 3 },
month = { Dec },
year = { 2017 },
issn = { 0975-8887 },
pages = { 6-8 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume179/number3/28714-2017915712/ },
doi = { 10.5120/ijca2017915712 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:54:18.811101+05:30
%A Garima Pandey
%A Mamta Martolia
%A Nitin Arora
%T A Novel String Matching Algorithm and Comparison with KMP Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 179
%N 3
%P 6-8
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In today’s world, we need fast algorithm with minimum errors for solving the problems. Pattern matching method is a real time problem. There exist different types of data in web application problems, for example, text files, image files, audio files and video files searching. For searching different types of data search engine is required and every search algorithm are used by every search engine for handling different types of data. This paper provides a modified version of KMP algorithm for text matching. This algorithm is implemented in C language and has been checked with arbitrary input arrangement of length 10,100,1000,5000,10000. The results reflect that the performance of modified KMP algorithms is better than that of KMP algorithm.

References
  1. Koloud Al-Khamaiseh and ShadiALShagarin, “A Survey of String Matching Algorithms” in Int. Journal of Engineering Research and Applications, IJERA, ISSN: 2248-9622, Vol. 4, Issue 7 (Version 2), July 2014, pp.144-156
  2. Robert S. Boyer and J. Strother Moore. "A fast string searching algorithm". Communications of the ACM, Volume 20, Number 10, pages 762{772, October 1977.
  3. Syeda Shabnam Hasan, Fareal Ahmed and Rosina Surovi Khan, “Approximate String Matching Algorithms: A Brief Survey and Comparison” in International Journal of Computer Applications, Volume 120 – No.8, June 2015.
  4. Iftikhar Hussain, SaminaKausar, Liaqat Hussain and Muhammad Asif Khan, “Improved Approach for Exact Pattern Matching” in International Journal of Computer Science Issues, Vol. 10, Issue 3, No 1, May 2013.
  5. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to algorithms, Third edition. The MIT Press, 2009.
  6. Robert Sedgewick and Kevin Wayne. Algorithms, Fourth edition.Addison-Wesley,2011
Index Terms

Computer Science
Information Sciences

Keywords

String Matching KMP Algorithms Data Structures.

Powered by PhDFocusTM