String Matching Algorithms and their Applicability in various Applications
Nimisha Singla1, Deepak Garg2
1Nimisha Singla, Department of Computer Science, Thapar University, Ludhiana, India.
2Dr. Deepak Garg, Department of Computer Science, Thapar University, Patiala, India.
Manuscript received on December 05, 2011. | Revised Manuscript received on December 18, 2011. | Manuscript published on January 05, 2012. | PP: 218-222 | Volume-1 Issue-6, January 2012. | Retrieval Number: F0304111611/2012©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In this paper the applicability of the various strings matching algorithms are being described. Which algorithm is best in which application and why. This describes the optimal algorithm for various activities that include string matching as an important aspect of functionality. In all applications test string and pattern class needs to be matched always.
Keywords: Databases, Dynamic programming, Search engine, String matching algorithms.