Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Pattern Matching with Address Errors: Rearrangement Distances Amihood Amir
 

Summary: Pattern Matching with Address Errors: Rearrangement Distances
Amihood Amir
Yonatan Aumann
Gary Benson
Avivit Levy
Ohad Lipsky
Ely Porat
Steven Skiena
Uzi Vishne
Abstract
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-

  

Source: Aumann, Yonatan - Computer Science Department, Bar Ilan University

 

Collections: Computer Technologies and Information Sciences