Asynchronous Pattern Matching

A. Amihood

Asynchronous Pattern Matching

A. Amihood

Department of Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

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 language	American English
State	Published - 2009
Event	09w5124 Mathematics of String Spaces and Algorithmic Applications - Banff, Canada Duration: 25 Jan 2009 → 28 Jan 2009

Conference

Conference	09w5124 Mathematics of String Spaces and Algorithmic Applications
Country/Territory	Canada
City	Banff
Period	25/01/09 → 28/01/09

Conference Invited Keynote
Amir, A. (Keynote speaker)
25 Jan 2009 → 28 Jan 2009
Activity: Talk or presentation › Invited talk

Cite this

@conference{2e00000716294ebc875b793c71927791,

title = "Asynchronous Pattern Matching",

abstract = "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.",

author = "A. Amihood",

year = "2009",

language = "American English",

note = "09w5124 Mathematics of String Spaces and Algorithmic Applications ; Conference date: 25-01-2009 Through 28-01-2009",

}

TY - CONF

T1 - Asynchronous Pattern Matching

AU - Amihood, A.

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

M3 - Paper

T2 - 09w5124 Mathematics of String Spaces and Algorithmic Applications

Y2 - 25 January 2009 through 28 January 2009

ER -

Asynchronous Pattern Matching

Abstract

Conference

Fingerprint

Activities

Conference Invited Keynote

Cite this