A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches (Q3558261)
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: A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches |
scientific article; zbMATH DE number 5703433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches |
scientific article; zbMATH DE number 5703433 |
Statements
A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches (English)
0 references
4 May 2010
0 references
string algorithms
0 references
parallel algorithms
0 references
approximate string-matching
0 references
0.94037294
0 references
0.9208456
0 references
0.9189501
0 references
0.9183165
0 references
0.9183165
0 references
0.9148541
0 references
0.91408885
0 references
