Guo, L., Du, S., Ren, M., Liu, Y., Li, J., He, J., Tian, N. and Li, K. (2013) Parallel Algorithm for Approximate String Matching with K Differences. IEEE Eighth International Conference on Net-working, Architecture and Storage, 17-19 July 2013, 257-261.
http://dx.doi.org/10.1109/NAS.2013.40

has been cited by the following article:

• TITLE: Four Sliding Windows Pattern Matching Algorithm (FSW)

  AUTHORS: Amjad Hudaib, Rola Al-Khalid, Aseel Al-Anani, Mariam Itriq, Dima Suleiman

  KEYWORDS: Pattern Matching, FWS, Enhanced Two Sliding Windows Algorithm, RS-A Fast Pattern Matching Algorithm

  JOURNAL NAME: Journal of Software Engineering and Applications, Vol.8 No.3, March 20, 2015

  ABSTRACT: This paper presents an efficient pattern matching algorithm (FSW). FSW improves the searching process for a pattern in a text. It scans the text with the help of four sliding windows. The windows are equal to the length of the pattern, allowing multiple alignments in the searching process. The text is divided into two parts; each part is scanned from both sides simultaneously using two sliding windows. The four windows slide in parallel in both parts of the text. The comparisons done between the text and the pattern are done from both of the pattern sides in parallel. The conducted experiments show that FSW achieves the best overall results in the number of attempts and the number of character comparisons compared to the pattern matching algorithms: Two Sliding Windows (TSW), Enhanced Two Sliding Windows algorithm (ETSW) and Berry-Ravindran algorithm (BR). The best time case is calculated and found to bewhile the average case time complexity is.