A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM (Q3421840): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient string matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast string searching algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Speeding up two string-matching algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Pattern Matching in Strings / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:50, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM |
scientific article |
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
