A faster algorithm for matching a set of patterns with variable length don't cares
type: Item
instance of: scholarly article
title: A faster algorithm for matching a set of patterns with variable length don't cares
zbMATH Open document ID: 1211.68141
author: Meng Zhang
author: Yi Zhang
author: Liang Hu
published in: Information Processing Letters
publication date: 2010-09-07T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 5780804
zbMATH Keywords: algorithms
zbMATH Keywords: string matching
zbMATH Keywords: variable length don't cares
describes a project that uses: Snort
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.12.007
OpenAlex ID: W2079235600
cites work: Efficient string matching
cites work: Improved dynamic dictionary matching
cites work: The smallest automaton recognizing the subwords of a text
cites work: Complete inverted files for efficient text retrieval and analysis
cites work: Compressed indexes for dynamic text collections
cites work: Transducers and repetitions
cites work: Q4055156
cites work: Q4420643
cites work: Matching a set of strings with variable length don't cares
cites work: An algorithm for string matching with a sequence of don't cares
cites work: A data structure for dynamic trees
DOI: 10.1016/J.IPL.2009.12.007
Recommended article: An algorithm for string matching with a sequence of don't cares
Recommended article: Matching a set of strings with variable length don't cares
Recommended article: Q4828997
Recommended article: Pattern Matching with Variables
Recommended article: Q3719846
Recommended article: Q2955004
Recommended article: Q4952702
Recommended article: Faster algorithms for string matching with k mismatches
Recommended article: Fast pattern-matching on indeterminate strings
Recommended article: Fast algorithms for two dimensional and multiple pattern matching
description: scientific article; zbMATH DE number 5780804