Searching for all occurrences of a pattern in a text is a fundamental problem in computer
science with applications in many other fields, like natural language processing, information …

This paper addresses the problems of data sanitization and cyber situational awareness by
analyzing 910 GB of real Internet-scale traffic, which has been passively collected by …

Searching for all occurrences of a pattern in a text is a fundamental problem in computer
science with applications in many other fields, like natural language processing, information …

In this paper we present a general approach to string matching based on multiple sliding text-
windows, and show how it can be applied to some among the most efficient algorithms for …

Given strings P and Q the (exact) string matching problem is to find all positions of substrings
in Q matching P. The classical Knuth–Morris–Pratt algorithm [SIAM J. Comput. 6 (2)(1977) …

Forward-SBNDM is a recently introduced variation of the BNDM algorithm for exact string
matching. Forward-SBNDM reads a text character following an alignment of the pattern. We …

Different approaches to speeding up the classical exact pattern matching Boyer–Moore–
Horspool algorithm are discussed. The first improves such known technique of exact pattern …

Forward-SBNDM is a recently introduced variation of the BNDM algorithm for exact string
matching. Forward-SBNDM inspects a 2-gram in the text such that the first character is the …

This article presents efficient quantum solutions for exact multiple pattern matching to
process the biological sequences. The classical solution takes Ο (mN) time for matching m …

A new family of perspective variable length self-synchronazable binary codes with multiple
pattern delimiters is introduced. Each delimiter consists of a run of consecutive ones …