TY - JOUR

T1 - Overlap matching

AU - Amir, Amihood

AU - Cole, Richard

AU - Hariharan, Ramesh

AU - Lewenstein, Moshe

AU - Porat, Ely

PY - 2003/2/25

Y1 - 2003/2/25

N2 - We propose a new paradigm for string matching, namely structural matching. In structural matching, the text and pattern contents are not important. Rather, some areas in the text and pattern, such as intervals, are singled out. A "match" is a text location where a specified relation between the text and pattern areas is satisfied. In particular we define the structural matching problem of overlap (parity) matching. We seek the text locations where all overlaps of the given pattern and text intervals have even length. We show that this problem can be solved in time O(n log m), where the text length is n and the pattern length is m. As an application of overlap matching, we show how to reduce the string matching with swaps problem to the overlap matching problem. The string matching with swaps problem is the problem of string matching in the presence of local swaps. The best deterministic upper bound known for this problem was O(nm1/3 log m log σ) for a general alphabet Σ, where σ = min(m, |Z|). Our reduction provides a solution to the pattern matching with swaps problem in time O(n log m log σ).

AB - We propose a new paradigm for string matching, namely structural matching. In structural matching, the text and pattern contents are not important. Rather, some areas in the text and pattern, such as intervals, are singled out. A "match" is a text location where a specified relation between the text and pattern areas is satisfied. In particular we define the structural matching problem of overlap (parity) matching. We seek the text locations where all overlaps of the given pattern and text intervals have even length. We show that this problem can be solved in time O(n log m), where the text length is n and the pattern length is m. As an application of overlap matching, we show how to reduce the string matching with swaps problem to the overlap matching problem. The string matching with swaps problem is the problem of string matching in the presence of local swaps. The best deterministic upper bound known for this problem was O(nm1/3 log m log σ) for a general alphabet Σ, where σ = min(m, |Z|). Our reduction provides a solution to the pattern matching with swaps problem in time O(n log m log σ).

UR - http://www.scopus.com/inward/record.url?scp=0037465502&partnerID=8YFLogxK

U2 - 10.1016/S0890-5401(02)00035-4

DO - 10.1016/S0890-5401(02)00035-4

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0037465502

SN - 0890-5401

VL - 181

SP - 57

EP - 74

JO - Information and Computation

JF - Information and Computation

IS - 1

ER -