Pattern Matching with Address Errors: Rearrangement Distances

A. Amihood, Y. Aumann, G. Benson, A. Levi, O. LLipsky, E. Porat, s. Skiena, U. Vishne

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 languageAmerican English
Title of host publication27th Annual ACM-SIAM Symposium of Discrete Algorithms (SODA)
StatePublished - 2006

Bibliographical note

Place of conference:Miami, FL


Dive into the research topics of 'Pattern Matching with Address Errors: Rearrangement Distances'. Together they form a unique fingerprint.

Cite this