Faster string matching based on hashing and bit-parallelism (Q522976): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:25, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster string matching based on hashing and bit-parallelism |
scientific article |
Statements
Faster string matching based on hashing and bit-parallelism (English)
0 references
20 April 2017
0 references
string matching
0 references
\(q\)-gram hashing
0 references
online algorithms
0 references
