Sublinear algorithms for approximating string compressibility (Q2392931)
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: Sublinear algorithms for approximating string compressibility |
scientific article; zbMATH DE number 6194540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sublinear algorithms for approximating string compressibility |
scientific article; zbMATH DE number 6194540 |
Statements
Sublinear algorithms for approximating string compressibility (English)
0 references
5 August 2013
0 references
sublinear algorithms
0 references
lossless compression
0 references
run-length encoding
0 references
Lempel-Ziv
0 references
0 references
0.98896723985672
0 references
0.8322299718856812
0 references
0.8059934377670288
0 references
0.7990781664848328
0 references
