Multi-pattern matching algorithm with wildcards based on bit-parallelism

DOI10.1007/S11859-017-1232-7MaRDI QIDQ5371909zbMATH OpenOpenAlexFDO

Authors Ahmed Saif, Liang Hu, Jianfeng Chu

Publication date 20 October 2017

Published in Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11859-017-1232-7

zbMATH Keywords

bit-parallelismmulti-patternstring matchingwildcard

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Pattern matching with arbitrary-length wildcards
• Pattern matching with wildcards using words of shorter length
• Parallel pattern matching algorithm with sparse gap constraint
• Streaming Pattern Matching with d Wildcards
• Streaming pattern matching with \(d\) wildcards

Cites work

• A faster algorithm for matching a set of patterns with variable length don't cares
• Alternative algorithms for bit-parallel string matching.
• Average-optimal string matching
• Compressed indexes for dynamic text collections
• Dictionary matching and indexing with errors and don't cares
• Faster pattern matching with character classes using prime number encoding
• scientific article; zbMATH DE number 3471577 (Why is no real title available?)
• scientific article; zbMATH DE number 1754502 (Why is no real title available?)
• scientific article; zbMATH DE number 2119723 (Why is no real title available?)
• Matching a set of strings with variable length don't cares
• Parallel string matching with variable length don't cares
• Pattern matching with wildcards and length constraints using maximum network flow
• Simple deterministic wildcard matching
• The smallest automaton recognizing the subwords of a text
• Verifying candidate matches in sparse and wildcard matching

Cited in

(9)

• Pattern matching with wildcards using words of shorter length
• The exact multiple pattern matching problem solved by a reference tree approach
• Revisiting multiple pattern matching algorithms for multi-core architecture
• ANALYSIS OF BIT-SPLIT LANGUAGES FOR PACKET SCANNING AND EXPERIMENTS WITH WILDCARD MATCHING
• New algorithms for pattern matching with wildcards and length constraints
• A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching
• Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms
• Pattern matching with arbitrary-length wildcards
• Parallel pattern matching algorithm with sparse gap constraint

This page was built for publication: Multi-pattern matching algorithm with wildcards based on bit-parallelism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5371909)