Pattern matching with wildcards using words of shorter length

DOI10.1016/J.IPL.2010.09.011MaRDI QIDQ1675874zbMATH OpenOpenAlexFDO

Authors Meng Zhang, Yi Zhang, Liang Hu

Publication date 3 November 2017

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

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

zbMATH Keywords

algorithmspattern matchingwildcards

Mathematics Subject Classification ID

Algorithms on strings (68W32) Analysis of algorithms (68W40)

Recommendations

• Faster pattern matching with character classes using prime number encoding
• Multi-pattern matching algorithm with wildcards based on bit-parallelism
• Fast convolutions of packed strings and pattern matching with wildcards
• From coding theory to efficient pattern matching
• Streaming pattern matching with \(d\) wildcards

Cites work

• Approximate formulas for some functions of prime numbers
• 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 2119723 (Why is no real title available?)
• Prime sieves using binary quadratic forms
• PRIMES is in P
• Simple deterministic wildcard matching
• Verifying candidate matches in sparse and wildcard matching

Cited in

(4)

• Faster pattern matching with character classes using prime number encoding
• Fast convolutions of packed strings and pattern matching with wildcards
• Multi-pattern matching algorithm with wildcards based on bit-parallelism
• Simple deterministic wildcard matching

This page was built for publication: Pattern matching with wildcards using words of shorter length

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