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 the normal view instead:
scientific article; zbMATH DE number 6106893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9323816299438475
0 references
0.8276697993278503
0 references
0.8026118874549866
0 references
0.8015754222869873
0 references
0.790044903755188
0 references
