String matching is a conventional problem in computer science. For a known text string ‘T’, the problem of string matching is to locate whether a pattern string ‘P’ occurs in ‘T’ or not, and if ‘P’ occurs then the position of ‘P’ in ‘T’ is reported. String matching sometimes called string searching has become an important aspect of the real world because it is being used in many applications where the string algorithm tries to find a location of one or several strings (also called Patterns) within a larger string or text (Text Data Set). A few of its essential applications are Spell Checkers, Spam Filters, Intrusion Detection System, Search Engines, Plagiarism Detection, Bioinformatics, Digital Forensics and Information Retrieval Systems, etc. The paper includes various string matching methodologies along with its historical contributory details in a variety of needful real world applications.

String Matching, Spell checkers, Spam Filter, Intrusion Detection System, Search Engines, Plagiarism Detection, Bioinformatics

[1] Thomas H Corman, Charles E. Leiserson, Oonald L. Rivest and Clifforf Stein, “Introduction to Algorithms – String Matching”, IEEE Edition, 2nd Edition, PP No. 906-907.
[2] Leena Salmela, J. Tarhio and J. Kytojoki “MultiPattern String Matching with Very Large Pattern Sets”, ACM Journal Algorithmic, Volume 11, 2006.
[3] Nimisha Singla, Deepak Garg, “String Matching Algorithms and their Applicability in Various Applications” IJSCE, ISSN 2231-2307 Vol I, PP No. 6, January 2012.
[4] Simone Faro and Thierry Lecroq, “The exact online string matching problem: A review of the most recent results” ACM computing surveys Vol .V, PP .N, Article A, January 2011.
[5] Gonzalo Navarro, “A Guided Tour to Approximate String”, ACM Computing Surveys, Vol 33 No. 1, PP No. 31-88, March 2001.
[6] Christian Charras and Thierry Lecroq, “Handbook of Exact String Matching Algorithms”, Published in King’s college publication, Feb 2004.
[7] Alberto Apostolico and ZviGalil,” Pattern Matching Algorithms” Published in Oxford University Press, USA, 1st edition, May 29, 1997.
[8] Morris J.H., Pratt V.R., 1970, “A Linear Pattern-Matching Algorithm”, Technical Report40, University of California, Berkeley 1970.
[9] Donald Knuth; James H. Morris, Jr, Vaughaz Pratt (1977). "Fast Pattern Matching in Strings". SIAM Journal on Computing 6 (2): 323–350. Doi: 10.1137/0206024.
[10] BOYER, R. S. AND MOORE, J. S,”A fast string searching algorithm”, Communication of ACM 20, Vol. 10, pp. 762–772, 1977.
[11] Alfred v. Aho and Margaret J. Corasick,”Efficient String Matching: An aid to Bibliographic Search” communication of ACM, vol. 18, june 1975.
[12] Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001-09-01). "The Rabin–Karp algorithm". Introduction to Algorithms (2nd ed.). Cambridge, Massachusetts: MIT Press. pp. 911–916.
[13] V. Saikrishna, A. Rasool, N. Khare, “String Matching and its Applications in Diversified Fields”, IJCSI Jan 2012, Volume 9- PP No 1.