Pattern matching with address errors: rearrangement distances (2006)
| Venue: | In SODA |
| Citations: | 6 - 0 self |
BibTeX
@INPROCEEDINGS{Amir06patternmatching,
author = {Amihood Amir and Yonatan Aumann and Gary Benson and Avivit Levy and Ohad Lipsky and Ely Porat and Steven Skiena and Uzi Vishne},
title = {Pattern matching with address errors: rearrangement distances},
booktitle = {In SODA},
year = {2006},
pages = {1221--1229},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. 1
