A faster algorithm for matching a set of patterns with variable length don't cares

DOI10.1016/j.ipl.2009.12.007zbMath1211.68141OpenAlexW2079235600MaRDI QIDQ991757

Yi Zhang, Meng Zhang, Liang Hu

Publication date: 7 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.12.007

zbMATH Keywords

algorithmsstring matchingvariable length don't cares

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10)

Related Items (8)

Mind the gap! ⋮ Online parameterized dictionary matching with one gap ⋮ Multi-pattern matching algorithm with wildcards based on bit-parallelism ⋮ Dictionary matching with a bounded gap in pattern or in text ⋮ Online recognition of dictionary with one gap ⋮ Parameterized dictionary matching and recognition with one gap ⋮ Dictionary matching with a few gaps ⋮ A comparative study of dictionary matching with gaps: limitations, techniques and challenges

Uses Software

• Snort

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for string matching with a sequence of don't cares
• The smallest automaton recognizing the subwords of a text
• Matching a set of strings with variable length don't cares
• Transducers and repetitions
• A data structure for dynamic trees
• Improved dynamic dictionary matching
• Compressed indexes for dynamic text collections
• Efficient string matching
• Complete inverted files for efficient text retrieval and analysis

This page was built for publication: A faster algorithm for matching a set of patterns with variable length don't cares