Analysis and Performance Evaluation of Selected Pattern Matching Algorithms

Abstract

Pattern matching algorithms are used to find one or more patterns or
sequence of patterns from huge text data or symbols. Pattern matching
algorithms work for many purposes in engineering as well as in
bioinformatics. Mostly, pattern matching algorithms are used for
information retrieval, intrusion detection, data compression, content
filtering, bioinformatics for analyzing DNA and other genome
sequences. In this paper, selected pattern matching algorithms
applied in the domain of document processing are discussed. The
discussion of these algorithms is based on analysis of operations,
execution time, and the number of comparisons required to locate or
determine a pattern. The investigation culminated in the
determination of the algorithm with the best performance
characteristics.