TY - GEN
T1 - Pattern matching with address errors: rearrangement distances
AU - Amihood, A.
AU - Aumann, Y.
AU - Benson, Gary
AU - Levy, Avivit
AU - Lipsky, Ohad
AU - Porat, E.
AU - Skiena, Steven
AU - Vishne, U.
N1 - Place of conference:USA
PY - 2006
Y1 - 2006
N2 - 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 l1 and l2 distances, as well as two distances based on interchanges. For these, we present efficient algorithms to solve the resulting string matching problems.
AB - 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 l1 and l2 distances, as well as two distances based on interchanges. For these, we present efficient algorithms to solve the resulting string matching problems.
UR - https://scholar.google.co.il/scholar?q=Pattern+matching+with+address+errors%3A+rearrangement+distances&btnG=&hl=en&as_sdt=0%2C5
M3 - Conference contribution
BT - seventeenth annual ACM-SIAM symposium on Discrete algorithm
PB - Society for Industrial and Applied Mathematics
ER -