Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching (Q1761497): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejc.2012.07.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1994855795 / rank | |||
Normal rank | |||
Revision as of 22:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching |
scientific article |
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
