A Simple Algorithm for Transposition-Invariant Amplified (δ, γ)-Matching

Authors:
Inbok Lee
Affiliations:
-
Venue:
IEICE - Transactions on Information and Systems
Year:
2008

Citing 4
Cited 0

Introduction to algorithms

Introduction to algorithms
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Approximate pattern matching plays an important role in various applications. In this paper we focus on (δ, γ)-matching, where a character can differ at most δ and the sum of these errors is smaller than γ. We show how to find these matches when the pattern is transformed by y = αx + β, without knowing α and β in advance.