Fast convolutions of packed strings and pattern matching with wildcards
From MaRDI portal
Recommendations
- Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
- Fast convolutions and their applications in approximate string matching
- Pattern matching with wildcards using words of shorter length
- Fast Searching in Packed Strings
- Fast searching in packed strings
Cites work
- Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
- Fast multiplication of large numbers
- Fast searching in packed strings
- Faster pattern matching with character classes using prime number encoding
- Pattern matching with wildcards using words of shorter length
- Rapid multiplication modulo the sum and difference of highly composite numbers
- Simple deterministic wildcard matching
- Towards optimal packed string matching
- Verifying candidate matches in sparse and wildcard matching
Cited in
(9)- 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
- Rank and select operations on a word
- An acceleration of FFT-based algorithms for the match-count problem
- Fast convolutions and their applications in approximate string matching
- Fast and flexible packed string matching
- Fast Packed String Matching for Short Patterns
- A faster algorithm for the computation of string convolutions using LZ78 parsing
This page was built for publication: Fast convolutions of packed strings and pattern matching with wildcards
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268397)
