期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2012
卷号：3
期号：2
页码：3394-3397
出版社：TechScience Publications
摘要：String matching is the problem of finding all occurrences of a character pattern in a text. This paper provides an overview of different string matching algorithms and comparative study of these algorithms. In this paper, we have evaluated several algorithms, such as Naive string matching algorithm, Brute Force algorithm, Rabin-Karp algorithm, Boyer-Moore algorithm, Knuth- Morris-Pratt algorithm, Aho-Corasick Algorithm and Commentz Walter algorithm. We analysed the core ideas of these single pattern string matching algorithms and multi-pattern string matching algorithms.We compared the matching efficiencies of these algorithms by searching speed, pre-processing time, matching time and the key ideas used in these algorithms. It is observed that performance of string matching algorithm is based on selection of algorithms used and also on netdth..
