On special families of morphisms related to δ-matching and don't care symbols
Document Type
Article
Publication Date
3-16-2003
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 |ℋ| = Θ(δ). © 2002 Elsevier Science B.V. All rights reserved.
Identifier
0037448824 (Scopus)
Publication Title
Information Processing Letters
External Full Text Location
https://doi.org/10.1016/S0020-0190(02)00430-1
ISSN
00200190
First Page
227
Last Page
233
Issue
5
Volume
85
Grant
CCR 0105678
Fund Ref
National Science Foundation
Recommended Citation
Cole, Richard; Iliopoulos, Costas; Lecroq, Thierry; Plandowski, Wojciech; and Rytter, Wojciech, "On special families of morphisms related to δ-matching and don't care symbols" (2003). Faculty Publications. 14156.
https://digitalcommons.njit.edu/fac_pubs/14156
