Elsevier

Information and Computation

Volume 181, Issue 1, 25 February 2003, Pages 57-74
Information and Computation

Overlap matching

https://doi.org/10.1016/S0890-5401(02)00035-4Get rights and content
Under an Elsevier user license
open archive

Abstract

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(nlogm), 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/3logmlogσ) for a general alphabet Σ, where σ=min(m,|Σ|). Our reduction provides a solution to the pattern matching with swaps problem in time O(nlogmlogσ).

Keywords

Design and analysis of algorithms
Combinatorial algorithms on words
Pattern matching
Pattern matching with swaps
Non-standard pattern matching

MSC

68R15

Cited by (0)

1

Partially supported by NSF grant CCR-01-04494, ISF grant 82/01, and BSF grant 96-00509.

2

Supported in part by NSF grant CCR-98-00085.

3

Work done in part while visiting NYU and supported by NSF grants CCR-95-03309 and CCR-98-00085.