The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
La correspondance approximative de modèles joue un rôle important dans diverses applications. Dans cet article, nous nous concentrons sur la correspondance (δ, γ), où un caractère peut différer d'au plus δ et la somme de ces erreurs est inférieure à γ. Nous montrons comment trouver ces correspondances lorsque le motif est transformé par y=αx + β, sans connaître α et β à l’avance.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Inbok LEE, "A Simple Algorithm for Transposition-Invariant Amplified (δ, γ)-Matching" in IEICE TRANSACTIONS on Information,
vol. E91-D, no. 6, pp. 1824-1826, June 2008, doi: 10.1093/ietisy/e91-d.6.1824.
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.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e91-d.6.1824/_p
Copier
@ARTICLE{e91-d_6_1824,
author={Inbok LEE, },
journal={IEICE TRANSACTIONS on Information},
title={A Simple Algorithm for Transposition-Invariant Amplified (δ, γ)-Matching},
year={2008},
volume={E91-D},
number={6},
pages={1824-1826},
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.},
keywords={},
doi={10.1093/ietisy/e91-d.6.1824},
ISSN={1745-1361},
month={June},}
Copier
TY - JOUR
TI - A Simple Algorithm for Transposition-Invariant Amplified (δ, γ)-Matching
T2 - IEICE TRANSACTIONS on Information
SP - 1824
EP - 1826
AU - Inbok LEE
PY - 2008
DO - 10.1093/ietisy/e91-d.6.1824
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E91-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2008
AB - 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.
ER -