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 describe a new publicly available algorithm for identifying absent sequences, and
demonstrate its use by listing the smallest oligomers not found in the human genome …

An edit distance is a metric between words that quantifies how two words differ by counting
the number of edit operations needed to transform one word into the other one. A word f is …

We revisit the complexity of one of the most basic problems in pattern matching. In the k-
mismatch problem we must compute the Hamming distance between a pattern of length m …

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 …

Historically, approximate pattern matching has mainly focused at coping with errors in the
data, while the order of the text/pattern was assumed to be more or less correct. In this paper …

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 …

The exact string matching problem is to find the occurrences of a pattern of length m from a
text of length n symbols. We develop a novel and unorthodox filtering technique for this …