A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM (Q3421840)
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 5123456
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM |
scientific article; zbMATH DE number 5123456 |
Statements
A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM (English)
0 references
8 February 2007
0 references
multiple string matching
0 references
bit-parallelism
0 references
text searching
0 references
0.8246812224388123
0 references
0.8221603035926819
0 references
0.8221600651741028
0 references
0.8133203387260437
0 references
0.8047321438789368
0 references
