Algorithms on extended (δ, γ)-matching

Authors:
Inbok Lee;Raphaël Clifford;Sung-Ryul Kim
Affiliations:
Department of Computer Science, King's College London, London, UK;Department of Computer Science, University of Bristol, UK;Division of Internet & Media and CAESIT, Konkuk University, Seoul, Republic of Korea
Venue:
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Year:
2006

Citing 5
Cited 1

Introduction to algorithms

Introduction to algorithms
Real scaled matching

Information Processing Letters
Transposition invariant string matching

Journal of Algorithms
Faster algorithms for δ,γ-matching and related problems

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Restricted transposition invariant approximate string matching under edit distance

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval

δ γ --- Parameterized Matching

SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

Approximate pattern matching plays an important role in various applications, such as bioinformatics, computer-aided music analysis and computer vision. We focus on (δ, γ)-matching. Given a text T of length n, a pattern P of length m,and two parameters δ and γ, the aim is to find all the substring T[i, i+m–1] such that (a) ∀ 1 ≤ j ≤ m, |T[i+j–1] – P[j]| ≤ δ (δ-matching) , and (b) ∑1≤j≤m |T[i+j–1] – P[j]| ≤ γ (γ-matching). In this paper we consider three variations of (δ, γ)-matching: amplified matching, transposition-invariant matching, and amplified transposition-invariant matching. For each problem we propose a simple and efficient algorithm which is easy to implement.