New Algorithm for Multiple Pattern Matching Using least Count of Pattern

Rapid advances in genome research in the past have resulted in generation of large set of data for DNA and protein sequences from different prokaryotic and eukaryotic genomes. DNA is made up of four nitrogenous bases known as adenine (A), guanine (G), thymine (T) and cytosine (C). Pattern matching technique generally divides into two categories i.e. single pattern matching and multiple pattern matching. When it is required to find all occurrences of the pattern in the given string, it is known as single pattern matching. When more than one pattern are matched against the given string simultaneously, it is known as multiple pattern matching. The study of pattern matching is one of the applications in the field of bioinformatics. Many algorithms are available in literature for pattern matching. The purpose of pattern matching algorithm is to reduce the number of character comparisons. Hence, in this paper an algorithm Multiple Pattern Matching using Least Count of Pattern (MPMLCP) has been proposed for multiple pattern matching. The proposed algorithm has been compared with the available algorithm and it has been shown that the number of comparisons reduces over the available algorithms. SAS 9.3 software package has been used for calculating the number of comparisons.