Pattern searching is a significant part of computer science. There are huge pattern searching approaches that exist to solve the string matching problems. There are huge fields of pattern matching such as pattern finding in a specific text, plagiarism detection, intelligent machine, bioinformatics, and video retrieval. The main intention of pattern searching is to reduce the shifting and comparisons. For reducing those factors, we have introduced an EPSA (Effective Pattern Searching Approach) algorithm which is a sequential hybrid approach. We have assembled the good properties of Berri Ravindran, Quick search, and raita algorithm to construct our EPSA algorithm. We have used DNA and protein sequences to test the efficiency of our EPSA algorithm. The proposed EPSA algorithm displays an effective result compared with the Back and Forth matching and Maximum Shift algorithm, which reduces the number of shifting and comparisons.
Keywords: Hybrid, Exact matching, Bioinformatics, Single pattern, on-line approach.
28-Feb-2025
