Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching (Q1761497)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching |
scientific article; zbMATH DE number 6106893
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching |
scientific article; zbMATH DE number 6106893 |
Statements
Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching (English)
0 references
15 November 2012
0 references
approximate string matching
0 references
pattern matching
0 references
convolutions
0 references
word RAM model of computation
0 references
0 references
