Detecting regularities on grammar-compressed strings (Q2514148)
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 6393281
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting regularities on grammar-compressed strings |
scientific article; zbMATH DE number 6393281 |
Statements
Detecting regularities on grammar-compressed strings (English)
0 references
30 January 2015
0 references
straight-line programs (SLPs)
0 references
runs
0 references
squares
0 references
gapped palindromes
0 references
compressed string processing algorithms
0 references
0 references
0 references
0 references
0.9835925102233888
0 references
0.7916243672370911
0 references
0.7794140577316284
0 references
0.7779655456542969
0 references
0.7766585350036621
0 references
