Avoiding approximate repetitions with respect to the longest common subsequence distance (Q2631171)
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 6607454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Avoiding approximate repetitions with respect to the longest common subsequence distance |
scientific article; zbMATH DE number 6607454 |
Statements
Avoiding approximate repetitions with respect to the longest common subsequence distance (English)
0 references
29 July 2016
0 references
approximate repetition
0 references
longest common subsequence
0 references
entropy compression
0 references
0.730933666229248
0 references
0.7255663871765137
0 references
0.724718451499939
0 references
0.7231394648551941
0 references
0.7122129797935486
0 references
