Activities per year
Abstract
Traditional Approximate Pattern Matching (e.g. Hamming distance errors, edit distance errors) assumes that various types of errors may occur to the data, but an implicit assumption is that the order of the data remains unchanged. Over the years, some applications identified types of "errors" were the data remains correct but its order is compromised. The earliest example is the "swap" error motivated by a common typing error. Other widely known examples such as transpositions, reversals and interchanges are motivated by biology. We propose that it is time to formally split the concept of "errors in data" and "errors in address" since they present different algorithmic challenges solved by different techniques. The "errors in address" model, which we call asynchronous pattern matching, since the data does not arrive in a synchronous sequential manner, is rich in problems not addresses hitherto. We will consider some reasonable metrics for asynchronous pattern matching, such as the number of inversions, or the number of generalized swaps, and show some efficient algorithms for these problems. As expected, the techniques needed to solve the problems are not taken from the standard pattern matching "toolkit".
Original language  American English 

State  Published  2005 
Event  Prague Stringology Conference (PSC)  Stringology, Prague, Czech Republic Duration: 28 Aug 2005 → 28 Aug 2005 
Conference
Conference  Prague Stringology Conference (PSC) 

Country/Territory  Czech Republic 
City  Prague 
Period  28/08/05 → 28/08/05 
Fingerprint
Dive into the research topics of 'Asynchronous Pattern Matching – Metrics'. Together they form a unique fingerprint.Activities
 1 Invited talk

Conference Invited Keynote
Amir, A. (Keynote speaker)
28 Aug 2005Activity: Talk or presentation › Invited talk