Asynchronous Pattern Matching

Research output: Contribution to conferencePaperpeer-review


This paper introduces a new pattern matching model that has been gaining importance recently, that of Asynchronous Pattern Matching. Traditional pattern matching has assumed the possibility of errors in the data content. We present motivation from text editing, computational biology, and computer architecture, that points to a new paradigm – where the errors occur in the address. It turns out that there are differences in techniques, complexities, and tools between the two different models, making it important to recognize their differences. We motivate and define the new model and present some problems that are worth pursuing.
Original languageAmerican English
StatePublished - 2009
Event09w5124 Mathematics of String Spaces and Algorithmic Applications - Banff, Canada
Duration: 25 Jan 200928 Jan 2009


Conference09w5124 Mathematics of String Spaces and Algorithmic Applications


Dive into the research topics of 'Asynchronous Pattern Matching'. Together they form a unique fingerprint.

Cite this