The widely used multiple pattern matching algorithms experience severe performance
degradation when the number of patterns to match increases. In light of this fact, this paper …

This letter proposes a multithreaded pattern matching algorithm which can efficiently
distribute the patterns to be searched on multiple threads to achieve rapid pattern matching …

Multi-pattern matching with variable-length wildcards is an interesting and important
problem in bioinformatics, information retrieval and other domains. Most of the previously …

In this paper an efficient pattern matching approach, based on a multithreading sliding
window technique, is proposed to improve the efficiency of the common sequential exact …

Bitwise operations are executed very fast in computer architecture. Algorithms aiming to
benefit from this intrinsic property can be classified as bit-parallel algorithms. Bit-parallelism …

This paper presents a novel, fast and scalable multiple string searching algorithm that can
locate many keywords within a larger text in a single pass. The new Wu-Manber variation …

String matching is playing a key role in a wide range of applications in the information
computing. Due to its importance, large numbers of different algorithms have been …

The paper described the standard Aho-Corasick algorithm process of multiple patterns
matching, and put forward a question about memory efficiency of Aho-Corasick automaton …

Approximate multi-pattern matching is an important issue that is widely and frequently
utilized, when the pattern contains variable-length wildcards. In this paper, two suffix array …

The strategy of packing several data values in a single computer word and refreshing them
all in a solitary operation is referred to bit parallelism. It assumes a significant part in pattern …