Using static suffix array in dynamic application: case of text compression by longest first substitution (Q477617)
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: Using static suffix array in dynamic application: case of text compression by longest first substitution |
scientific article; zbMATH DE number 6378650
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using static suffix array in dynamic application: case of text compression by longest first substitution |
scientific article; zbMATH DE number 6378650 |
Statements
Using static suffix array in dynamic application: case of text compression by longest first substitution (English)
0 references
9 December 2014
0 references
algorithms
0 references
enhanced suffix array
0 references
grammar text compression
0 references
longest first substitution
0 references
text index update
0 references
0.8623786
0 references
0.8471728
0 references
0 references
0.8345858
0 references
0.83132154
0 references
0.83098274
0 references
0.83098274
0 references
0.8286479
0 references
0.8278734
0 references
