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. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
| Property / cites work | |||
| Property / cites work: Q4952702 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4028869 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4055156 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3747742 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast bit-vector algorithm for approximate string matching based on dynamic programming / rank | |||
Normal rank | |||
Latest revision as of 15:26, 2 July 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
