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

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 …

Abstract Background/Objectives: Information Retrieval Systems (IRS) are playing an eminent
role in different applications like World Wide Web, DNA sequence retrieval, etc. Basically …

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 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 …

Multi-pattern string matching is used in many research areas like security, data mining,
machine learning, data analytics and search engines etc. Multi-pattern string matching …

String matching is a fundamental problem in computer science. It has been widely used in
many important fields. In this article, we presented an integer comparison method to improve …

Pattern matching with wildcards (PMW) has great theoretical and practical significance in
bioinformatics, information retrieval, and pattern mining. Due to the uncertainty of wildcards …

The problem of searching occurrences of a pattern P [0... m-1] in the text T [0... n-1] with m≤
n, where the symbols of P and T are drawn from some alphabet Σ of size σ, is called exact …

The WM algorithm, designed by Sun Wu and Udi Manber, is considered the fastest multi-
pattern string matching algorithm in practice except when the pattern number is very large or …