Approximating Longest Common Substring with k mismatches: Theory and Practice (Q5874444)
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: Approximating Longest Common Substring with k mismatches: Theory and Practice |
scientific article; zbMATH DE number 7651107
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating Longest Common Substring with k mismatches: Theory and Practice |
scientific article; zbMATH DE number 7651107 |
Statements
7 February 2023
0 references
approximation algorithms
0 references
string similarity
0 references
LSH
0 references
conditional lower bounds
0 references
Approximating Longest Common Substring with k mismatches: Theory and Practice (English)
0 references
