ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Overlap Matching

Amir, Amihood and Cole, Richard and Hariharan, Ramesh and Lewenstein, Moshe and Porat, Ely (2001) Overlap Matching. In: The twelfth annual ACM-SIAM symposium on Discrete algorithms, January 07 - 09, Washington, D.C., United States, pp. 279-288.

[img] PDF
fulltext.pdf
Restricted to Registered users only

Download (755Kb) | Request a copy

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 patterns are singled out, say intervals. 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 known deterministic upper bound for this problem was $O(nm^{l/3}1ogmlog\sigma)$ for a general alphabet \Sigma, where \sigma = min(m, \vert \Sigma \vert).

Item Type: Conference Paper
Additional Information: Copyright of this article belongs to Society for Industrial and Applied Mathematics.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 18 Jul 2008
Last Modified: 19 Sep 2010 04:47
URI: http://eprints.iisc.ernet.in/id/eprint/15108

Actions (login required)

View Item View Item