Approximate pattern matching with \(k\)-mismatches in packed text (Q2445229)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6284206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate pattern matching with \(k\)-mismatches in packed text |
scientific article; zbMATH DE number 6284206 |
Statements
Approximate pattern matching with \(k\)-mismatches in packed text (English)
0 references
14 April 2014
0 references
combinatorial problems
0 references
string algorithms
0 references
\(k\)-mismatches
0 references
Hamming distance
0 references
word-level parallelism
0 references
0 references
0 references
0.8630183339118958
0 references
0.8612017035484314
0 references
0.8590885996818542
0 references
0.8567028641700745
0 references
