Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time (Q2380069)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bit-parallel string matching under Hamming distance in O(n m/w) worst case time |
scientific article; zbMATH DE number 5686496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time |
scientific article; zbMATH DE number 5686496 |
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
0.874762773513794
0 references
0.8741320371627808
0 references
0.85074383020401
0 references
0.8473307490348816
0 references
