Pages that link to "Item:Q1761497"
From MaRDI portal
The following pages link to Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching (Q1761497):
Displayed 5 items.
- On approximate pattern matching with thresholds (Q522963) (← links)
- Rank and select operations on a word (Q2234779) (← links)
- Approximate pattern matching with \(k\)-mismatches in packed text (Q2445229) (← links)
- An acceleration of FFT-based algorithms for the match-count problem (Q2628276) (← links)
- Fast Convolutions of Packed Strings and Pattern Matching with Wildcards (Q5268397) (← links)
