Design and implementation of an application based on string matching algorithms

Abstract

String matching algorithms are an important class of string algorithms that try to find a place where one or several strings (patterns) are found within a larger string (text). String matching is a classical problem in computer science and is applied to various fields inside and outside computing. Some of the areas concerned include intrusion detection in networking, information security and pattern recognition. In this project, we are going to study, analyze, compare and implement several string-matching algorithms.