期刊名称：International Journal of Computer Science Issues
印刷版ISSN：1694-0784
电子版ISSN：1694-0814
出版年度：2012
卷号：9
期号：1
出版社：IJCSI Press
摘要：String searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text. String matching is a classical problem in computer science. In this paper we are trying to explore the various diversified fields where string matching has an eminent role to play and is found as a solution to many problems. Few of the fields exploited are intrusion detection in network, application in bioinformatics, detecting plagiarism, information security, pattern recognition, document matching and text mining. Here we discuss how string matching is found useful in finding solutions to above problems. String matching algorithms can be categorized either as exact string matching algorithms or approximate string matching algorithms . Also depending upon the kind of application, string matching algorithms are designed either to work on single pattern or multiple patterns. Followed by a brief introduction to string matching, the application areas are discussed.
关键词：String matching; intrusion detection; bioinformatics; pattern recognition; text mining; digital forensics.
