On special families of morphisms related to δ-matching and don't care symbols

Richard Cole, Costas Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter

Research output: Contribution to journalArticle

Abstract

The δ-matching problem is a special version of approximate pattern-matching, motivated by applications in musical information retrieval, where the alphabet Σ is an interval of integers. We investigate relations between δ-matching and pattern-matching with don't care symbol * (a symbol matching every symbol, including itself). We show that the δ-matching is reducible to k instances of pattern-matching with don't cares. We investigate how the numbers δ and k are related by introducing δ-distinguishing families ℋ of morphisms. The size of ℋ corresponds to k. We show that for minimal families ℋ we have |ℋ| = Θ(δ).

Original languageEnglish (US)
Pages (from-to)227-233
Number of pages7
JournalInformation Processing Letters
Volume85
Issue number5
DOIs
StatePublished - Mar 16 2003

Fingerprint

Pattern matching
Pattern Matching
Morphisms
Matching Problem
Information retrieval
Information Retrieval
Interval
Integer
Family

Keywords

  • δ-matching
  • Combinatorial problems
  • Don't care symbols
  • Pattern-matching

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

On special families of morphisms related to δ-matching and don't care symbols. / Cole, Richard; Iliopoulos, Costas; Lecroq, Thierry; Plandowski, Wojciech; Rytter, Wojciech.

In: Information Processing Letters, Vol. 85, No. 5, 16.03.2003, p. 227-233.

Research output: Contribution to journalArticle

Cole, Richard ; Iliopoulos, Costas ; Lecroq, Thierry ; Plandowski, Wojciech ; Rytter, Wojciech. / On special families of morphisms related to δ-matching and don't care symbols. In: Information Processing Letters. 2003 ; Vol. 85, No. 5. pp. 227-233.
@article{ce36cb2161ee4e3d8ef0b95b1748a730,
title = "On special families of morphisms related to δ-matching and don't care symbols",
abstract = "The δ-matching problem is a special version of approximate pattern-matching, motivated by applications in musical information retrieval, where the alphabet Σ is an interval of integers. We investigate relations between δ-matching and pattern-matching with don't care symbol * (a symbol matching every symbol, including itself). We show that the δ-matching is reducible to k instances of pattern-matching with don't cares. We investigate how the numbers δ and k are related by introducing δ-distinguishing families ℋ of morphisms. The size of ℋ corresponds to k. We show that for minimal families ℋ we have |ℋ| = Θ(δ).",
keywords = "δ-matching, Combinatorial problems, Don't care symbols, Pattern-matching",
author = "Richard Cole and Costas Iliopoulos and Thierry Lecroq and Wojciech Plandowski and Wojciech Rytter",
year = "2003",
month = "3",
day = "16",
doi = "10.1016/S0020-0190(02)00430-1",
language = "English (US)",
volume = "85",
pages = "227--233",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "5",

}

TY - JOUR

T1 - On special families of morphisms related to δ-matching and don't care symbols

AU - Cole, Richard

AU - Iliopoulos, Costas

AU - Lecroq, Thierry

AU - Plandowski, Wojciech

AU - Rytter, Wojciech

PY - 2003/3/16

Y1 - 2003/3/16

N2 - The δ-matching problem is a special version of approximate pattern-matching, motivated by applications in musical information retrieval, where the alphabet Σ is an interval of integers. We investigate relations between δ-matching and pattern-matching with don't care symbol * (a symbol matching every symbol, including itself). We show that the δ-matching is reducible to k instances of pattern-matching with don't cares. We investigate how the numbers δ and k are related by introducing δ-distinguishing families ℋ of morphisms. The size of ℋ corresponds to k. We show that for minimal families ℋ we have |ℋ| = Θ(δ).

AB - The δ-matching problem is a special version of approximate pattern-matching, motivated by applications in musical information retrieval, where the alphabet Σ is an interval of integers. We investigate relations between δ-matching and pattern-matching with don't care symbol * (a symbol matching every symbol, including itself). We show that the δ-matching is reducible to k instances of pattern-matching with don't cares. We investigate how the numbers δ and k are related by introducing δ-distinguishing families ℋ of morphisms. The size of ℋ corresponds to k. We show that for minimal families ℋ we have |ℋ| = Θ(δ).

KW - δ-matching

KW - Combinatorial problems

KW - Don't care symbols

KW - Pattern-matching

UR - http://www.scopus.com/inward/record.url?scp=0037448824&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037448824&partnerID=8YFLogxK

U2 - 10.1016/S0020-0190(02)00430-1

DO - 10.1016/S0020-0190(02)00430-1

M3 - Article

VL - 85

SP - 227

EP - 233

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 5

ER -