Abstract
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 consider a class of pattern
matching problems where the content is assumed to be
correct, while the locations may have shifted/changed.
We formally define a broad class of problems of this
type, capturing situations in which the pattern is obtained
from the text by a sequence of rearrangements.
We consider several natural rearrangement schemes, including
the analogues of the `1 and `2 distances, as well
as two distances based on interchanges. For these, we
present efficient algorithms to solve the resulting string
matching problems
Original language | American English |
---|---|
Title of host publication | 27th Annual ACM-SIAM Symposium of Discrete Algorithms (SODA) |
State | Published - 2006 |