We survey the current techniques to cope with the problem of string matching that allows
errors. This is becoming a more and more relevant issue for many fast growing areas such …

The string matching with mismatches problem is that of finding the number of mismatches
between a pattern P of length m and every length m substring of the text T. Currently, the …

We introduce a new string matching problem called order-preserving matching on numeric
strings, where a pattern matches a text if the text contains a substring of values whose …

We propose a new paradigm for string matching, namely structural matching. In structural
matching, the text and pattern contents are not important. Rather, some areas in the text and …

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 …

We introduce a new metric of match, called Cartesian tree matching, which means that two
strings match if they have the same Cartesian trees. Based on Cartesian tree matching, we …

We present problems in different application areas: tandem repeats (computational biology),
poetry and music analysis, and author validation, that require a more sophisticated pattern …

Recently, there has been a growing focus in solving approximate pattern matching problems
in the streaming model. Of particular interest are the pattern matching with k-mismatches …

We introduce a new metric of match, called Cartesian tree matching, which means that two
strings match if they have the same Cartesian trees. Based on Cartesian tree matching, we …

Given two indeterminate equal-length strings p and t with a set of characters per position in
both strings, we obtain a determinate string p_w from p and a determinate string t_w from t …