We introduce a new text-indexing data structure, the String B-Tree, that can be seen as a link
between some traditional external-memory and string-matching data structures. In a short …

Plagiarism is a growing problem in academia. Academics often use plagiarism detection
tools to detect similar source-code files. Once similar files are detected, the academic …

The problem of finding sections of code that either are identical or are related by the
systematic renaming of variables or constants can be modeled in terms ofparameterized …

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 …

Jumbled indexing is the problem of indexing a text T for queries that ask whether there is a
substring of T matching a pattern represented as a Parikh vector, ie, the vector of frequency …

An experiment was carried out by a group of scientists to compare different tools and
techniques for detecting duplicated or near-duplicated source code. The overall comparative …

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 …

Parameterized strings were introduced by Baker to solve the problem of identifying blocks of
code that get duplicated in a large software system. Parameter symbols capture the notion of …

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 …

String matching is one of the oldest algorithmic techniques, yet still one of the most
pervasive in computer science. The past 20 years have seen technological leaps in …