Faster string matching based on hashing and bit-parallelism (Q522976): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W32 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W27 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6706368 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
string matching | |||
| Property / zbMATH Keywords: string matching / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
\(q\)-gram hashing | |||
| Property / zbMATH Keywords: \(q\)-gram hashing / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
online algorithms | |||
| Property / zbMATH Keywords: online algorithms / rank | |||
Normal rank | |||
Revision as of 05:52, 1 July 2023
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
