ERS-A Algorithm for Pattern Matching
Dima Suleiman, Amjad A. Hudaib, Aseel Al-Anani, Rola Al-Khalid, Mariam Itriq · 2013
3 Abstract: Pattern matching algorithms have many applications that cover a wide range including information retrieval, text processing, DNA sequence analysis and pattern recognition. In this paper, we propose a new algorithm ERS-A, that made enhancements on both two sliding windows (TSW) and Fast Pattern Matching (RS-A) algorithms. In ERS-A and TSW algorithms two sliding windows are used to scan the text from the left and right simultaneously, but while TSW utilizes the idea of Berry Ravindran bad character shift function (BR), ERS-A adds an improvement by using the shift technique provided by RS-A algorithm. RS-A algorithm uses four consecutive characters in the text immediately following the pattern window, instead of using two consecutive characters as in BR. The experimental results show that the ERS-A has enhanced the searching process significantly.