Loading...
A two-hashing table multiple string pattern matching algorithm
Author(s)
Khancome, Chouvalit
Boonjing, Veera
Chanvarasuth, Pisit
Date Issued
November 4, 2013
Type
Conference Paper
Abstract
Multiple string pattern matching is one of many approaches to simultaneously search occurrences of a large number of patterns in a given text. In this paper, a new solution to this problem is presented by using two-hashing tables to minimize attempting times. This solution, called Two-Hashing Table Multiple String Patterns Matching Algorithm (Two-HT-MSPMA), is suitable for very long length of minimum pattern length. Its time complexity is more efficient than classic algorithms. Empirical results showed that its attempting times were less than of traditional algorithms. © 2013 IEEE.
Citation
Proceedings of the 2013 10th International Conference on Information Technology New Generations Itng 2013, 696-701, 2013