A note on the longest common substring with \(k\)-mismatches problem (Q2345875)
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 note on the longest common substring with k-mismatches problem
scientific article; zbMATH DE number 6438122
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the longest common substring with \(k\)-mismatches problem |
scientific article; zbMATH DE number 6438122 |
Statements
A note on the longest common substring with \(k\)-mismatches problem (English)
0 references
21 May 2015
0 references
combinatorial problems
0 references
string algorithms
0 references
longest common substring with \(k\)-mismatches
0 references
word-level parallelism
0 references
0.9236008524894714
0 references
0.8963925838470459
0 references
0.8878323435783386
0 references
0.8780718445777893
0 references
0.8374243378639221
0 references
