Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time (Q2380069): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:37, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time |
scientific article |
Statements
Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time (English)
0 references
24 March 2010
0 references
algorithms
0 references
approximate string matching
0 references
bit-parallelism
0 references
Hamming distance
0 references
