Pancreatic cancer is one of the highly invasive and the seventh most common cause of
death among cancers worldwide. To identify essential genes and the involved mechanisms …

String matching is a classical computer science problem where we search for all the
occurrences of a text string of size m, typically called pattern, in a string of size n, where both …

Cartesian tree matching is the problem of finding every substring of a given text which has
the same Cartesian tree as that of a given pattern. In this paper we propose fast algorithms …

String matching is one of the most extensively studied problems in computer science, mainly
due to its direct applications to such diverse areas as text, image and signal processing …

In this paper we propose the Maximal Average Shift (MAS) algorithm that finds a pattern
scan order that maximizes the average shift length. We also present two extensions of MAS …

We present a simple and very efficient algorithm for string matching based on the
combination of weak factor recognition and hashing. Despite its quadratic worst-case …

The string-matching paradigm is applied in every computer science and science branch in
general. The existence of a plethora of string-matching algorithms makes it hard to choose …

The swap matching problem consists in finding all occurrences of a pattern x of length m in a
text y of length n, allowing for disjoint local swaps of characters in the pattern. In 2003, Amir …

Abstract Automata based algorithms have always dominated the history of string matching,
thanks to their intrinsic nature of recognizers. Among them, those based on the suffix …

More than 120 algorithms have been developed for exact string matching within the last 40
years. We show by experiments that the naïve algorithm exploiting SIMD instructions of …