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 …