Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time (Q2380069): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2007.08.021 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2166943643 / rank | |||
Normal rank | |||
Revision as of 21:54, 19 March 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
