Enhancing ERS-A Algorithm for Pattern Matching (EERS-A)

Abstract

Pattern matching is a very important topic in computer science. It has been used in various applications such as information retrieval, virus scanning, DNA sequence analysis, data mining, machine learning, network security and pattern recognition. This paper has presented a new pattern matching algorithm-Enhanced ERS-A, which is an improvement over ERS-S algorithm. In ERS-A, two sliding windows are used to scan the text from the left and the right simultaneously. The proposed algorithm also scans the text from the left and the right simultaneously as well as making comparisons with the pattern from both sides simultaneously. The comparisons done between the text and the pattern are done from both sides in parallel. The shift technique used in the Enhanced ERS-A is the four consecutive characters in the text immediately following the pattern window. The experimental results show that the Enhanced ERS-A has enhanced the process of pattern matching by reducing the number of comparisons performed.

Four Sliding Windows Pattern Matching Algorithm (FSW)

“…The Enhanced RS-A algorithm (ERS-A) [19] utilizes the idea of RS-A algorithm to get better shift values. ERS-A algorithm uses four consecutive characters in the text immediately to the right of the pattern window.…”

A Fast Pattern Matching Algorithm Using Changing Consecutive Characters

“…In some algorithms, comparisons occur between the text and the pattern from only one side of the text either the left side [13] or the right one [4] by aligning one pattern with the text. Other algorithms use two sliding windows to make comparisons by using two patterns, one pattern aligned with the text from left side of the text, and the second pattern aligned with the text from the right side, comparisons occur in parallel [5] [6] [11] [16].…”

“…Most of algorithms determine the shift value according to the number of consecutive characters on the text after aligning the pattern with the text. Some algorithms take one consecutive character [7] [17] some take two [6] [13] [16] others use three and few use four [8] [9]. This paper proposes a new Pattern Matching algorithm Using Changing Consecutive Characters (PMCCC) to make the searching process of the algorithm faster.…”

Parallel Enhanced Pattern Matching Algorithm with Two Sliding Windows PETSW

“…Many studies on string matching problem have been conducted over the years to develop efficient algorithms; most of these algorithms enhance number of attempts and number of comparisons through using sliding window(s) with the best shift values [3][4] [7][8][9][10][11][12][13].…”

“…The Enhanced Two Sliding Windows algorithm (ETSW) [7] is an extended version of Two Sliding Window algorithm (TSW) [4] as well as ERS-A [3], FSW [9], EBR [5], EERS-A [10] and DBR [8] algorithms.…”