Fast Convolutions of Packed Strings and Pattern Matching with Wildcards

DOI10.1142/S0129054117500186zbMath1371.68342OpenAlexW2616151137MaRDI QIDQ5268397

Meng Zhang

Publication date: 20 June 2017

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054117500186

zbMATH Keywords

convolutionstring matchingwildcardsbit-parallelismpacked stringsword-RAM

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Related Items (1)

Rank and select operations on a word

Cites Work

• Fast searching in packed strings
• Simple deterministic wildcard matching
• Faster pattern matching with character classes using prime number encoding
• Pattern matching with wildcards using words of shorter length
• Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
• Towards optimal packed string matching
• Fast multiplication of large numbers
• Verifying candidate matches in sparse and wildcard matching
• Rapid multiplication modulo the sum and difference of highly composite numbers

This page was built for publication: Fast Convolutions of Packed Strings and Pattern Matching with Wildcards