Pages that link to "Item:Q1662518"
From MaRDI portal
The following pages link to Linear-time text compression by longest-first substitution (Q1662518):
Displaying 4 items.
- Searching for smallest grammars on large sequences and application to DNA (Q414452) (← links)
- Using static suffix array in dynamic application: case of text compression by longest first substitution (Q477617) (← links)
- The smallest grammar problem as constituents choice and minimal grammar parsing (Q1736491) (← links)
- Bidirectional Text Compression in External Memory (Q5075783) (← links)
