Summary: Pattern Matching with Address Errors: Rearrangement Distances
Avivit Levy §
Steven Skiena ¶
Historically, approximate pattern matching has mainly
focused at coping with errors in the data, while the or-
der 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 ob-
tained from the text by a sequence of rearrangements.
We consider several natural rearrangement schemes, in-