A data structure for substring-substring LCS length queries (Q2118872)
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 7496385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A data structure for substring-substring LCS length queries |
scientific article; zbMATH DE number 7496385 |
Statements
A data structure for substring-substring LCS length queries (English)
0 references
23 March 2022
0 references
algorithms
0 references
longest common subsequence
0 references
semi-local string comparison
0 references
0 references
0 references
0.8210182785987854
0 references
0.8207979798316956
0 references
0.8147693872451782
0 references
0.814125120639801
0 references
0.8018848299980164
0 references
