Fast parameterized matching with \(q\)-grams
type: Item
instance of: scholarly article
title: Fast parameterized matching with \(q\)-grams
zbMATH Open document ID: 1160.68483
author: Leena Salmela
author: Jorma Tarhio
published in: Journal of Discrete Algorithms
publication date: 2009-05-13T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 5553595
zbMATH Keywords: string matching
zbMATH Keywords: 2-dimensional string matching
zbMATH Keywords: parameterized matching
MaRDI profile type: Publication
full work available at URL: j.jda.2007.11.001
OpenAlex ID: W2041741600
cites work: Q4449230
cites work: Alphabet dependence in parameterized matching
cites work: A theory of parameterized pattern matching
cites work: Q4252375
cites work: Q4886089
cites work: A fast string searching algorithm
cites work: Faster suffix tree construction with missing suffix links
cites work: Speeding up two string-matching algorithms
cites work: Efficient parameterized string matching
cites work: Algorithms – ESA 2004
cites work: Combinatorial Pattern Matching
cites work: Multiple matching of parameterized patterns
cites work: Fast Pattern Matching in Strings
cites work: Q4252748
cites work: Q4234989
cites work: Multipattern string matching with q -grams
cites work: Approximate Boyer–Moore String Matching
DOI: 10.1016/J.JDA.2007.11.001
description: scientific article; zbMATH DE number 5553595