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 …

In this paper we give a randomized O (nlogn)-time algorithm for the string matching with
don't cares problem. This improves the Fischer-Paterson bound from 1974 and answers the …

Let a text string T of n symbols and a pattern string P of m symbols from alphabet Σ be given.
A swapped version T′ of T is a length n string derived from T by a series of local swaps (ie …

How fast can you test whether a constellation of stars appears in the night sky? This
question can be modeled as the computational problem of testing whether a set of points P …

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 …

In this paper we consider the problem of finding the approximate nearest neighbor when the
data set points are the substrings of a given text T. Specifically, for a string T of length n, 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 …

The problem of geometric point set matching has been studied extensively in the domain of
computational geometry, and has many applications in areas such as computer vision …

We present new faster algorithms for the problems of δ and (δ, γ)-matching on numeric
strings. In both cases the running time of the proposed algorithms is shown to be O (δn log …