Faster string matching based on hashing and bit-parallelism (Q522976)
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 6706368
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster string matching based on hashing and bit-parallelism |
scientific article; zbMATH DE number 6706368 |
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
0.8653070330619812
0 references
0.818760871887207
0 references
0.8183889389038086
0 references
