Call for Paper - August 2020 Edition
IJCA solicits original research papers for the August 2020 Edition. Last date of manuscript submission is July 20, 2020. Read More

Study of Selected Shifting based String Matching Algorithms

Print
PDF
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2016
Authors:
G.L. Prajapati, Mohd. Sharique, Piyush Nagani, Adarsh V.
10.5120/ijca2016909441

G L Prajapati, Mohd. Sharique, Piyush Nagani and Adarsh V.. Article: Study of Selected Shifting based String Matching Algorithms. International Journal of Computer Applications 140(9):18-27, April 2016. Published by Foundation of Computer Science (FCS), NY, USA. BibTeX

@article{key:article,
	author = {G.L. Prajapati and Mohd. Sharique and Piyush Nagani and Adarsh V.},
	title = {Article: Study of Selected Shifting based String Matching Algorithms},
	journal = {International Journal of Computer Applications},
	year = {2016},
	volume = {140},
	number = {9},
	pages = {18-27},
	month = {April},
	note = {Published by Foundation of Computer Science (FCS), NY, USA}
}

Abstract

This paper presents detailed comparisons and analysis of shift-based exact string matching algorithms. The paper proposes comparison among these algorithms on the basis of execution time taken by the algorithms to completely match a given pattern on a given text. The algorithms have been analyzed on the following parameters: length of pattern, length of text, and number of characters in the text. This study will help in selecting the appropriate algorithm to be used in solving a particular real-life problem.

References

  1. C. Charas, T. Lecroq and J. D. Pehoushek. 2005. A very fast string matching algorithm for small alphabets and long patterns, Lecture notes in Computer Scienc, Volume 1448, pp. 55-64.
  2. J. J. McConnell, Analysis of Algorithms,Canisius College, pp 125-128.
  3. M. Crochemore and D. Perrin, 1991, Two Way String Matching, Journal of the Association for Computing Machinery, Vol. 38, No 3, pp.65I-675.
  4. T. Raita, 1992, Tuning the Boyer–Moore–Horspool String, Searching Algorithm, Software Practice and Experience, Vol 22(10),pp 879–884.
  5. R. Baeza-Yates and G. H. Gonnet, 1992, A New Approach To Text Searching, Communication of the ACM,Vol.35, No.10.
  6. James Lee Holloway, 1992, Algorithms for string matching with applications in molecular biology, Oregon State University Corvallis, OR, USA
  7. Luqman Gbadamosi, 2013, VOICE RECOGNITION SYSTEM USING TEMPLATE MATCHING, International Journal of Research in Computer Science eISSN 2249-8265 Volume 3 Issue 5 (2013) pp. 13-17.
  8. Saurabh Tiwari and Deepak Motwani, 2014, Feasible Study on Pattern Matching Algorithms based on Intrusion Detection Systems. International Journal of Computer Applications 96(20):13-17.
  9. Kavita Ahuja 1, Preeti Tuli 2, 2013,Object Recognition by Template Matching Using Correlations and Phase Angle Method, International Journal of Advanced Research in Computer and Communication Engineering, Vol. 2, Issue 3.
  10. Prabhudeva S, 2008, Plagiarism Detection by using Karp-Rabin and String Matching Algorithm Together Sonawane Kiran Shivaji Master of Engineering, Computer Engineering, Ahmednagar, Maharashtra, IJCSNS International Journal of Computer Sci 314 ence and Network Security, VOL.8 No.10.
  11. Jamuna Bhandari and Anil Kumar, 2013, International Journal of Computer Science Engineering (IJCSE), Vol. 2 No.05 .
  12. DavidM.Magerman,1994 ,NATURAL LANGUAGE PARSING AS STATISTICAL PATTERN RECOGNITION, of computer science and the committee on graduate studies of stanford university in partial fulfillment of the requirements for the degree of doctor of philosophy.
  13. Koloud Al-Khamaiseh, 2014, A Survey of String Matching Algorithms Int. Journal of Engineering Research and Applications www.ijera.com ISSN: 2248-9622, Vol. 4, Issue 7( Version 2), pp.144-156.

Keywords

String Matching, Exact String Matching, Shifting Based, Execution Time, Performance Analysis.