Faster string matching based on hashing and bit-parallelism (Q522976): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2017.03.005 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2017.03.005 / rank | |||
Normal rank | |||
Latest revision as of 20:21, 9 December 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
