Pages that link to "Item:Q3951542"
From MaRDI portal
The following pages link to Data compression via textual substitution (Q3951542):
Displaying 50 items.
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case (Q396650) (← links)
- Recognition of overlap graphs (Q405660) (← links)
- Dictionary-symbolwise flexible parsing (Q450551) (← links)
- Using static suffix array in dynamic application: case of text compression by longest first substitution (Q477617) (← links)
- Practical fixed length Lempel-Ziv coding (Q496549) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- Text compression methods (Q805263) (← links)
- Novel results on the number of runs of the Burrows-Wheeler-transform (Q831816) (← links)
- Compressed parameterized pattern matching (Q897868) (← links)
- Finding the longest common nonsuperstring in linear time (Q989576) (← links)
- On updating suffix tree labels (Q1129015) (← links)
- P-complete problems in data compression (Q1325842) (← links)
- Truncated suffix trees and their application to data compression. (Q1401392) (← links)
- Comparison of LZ77-type parsings (Q1621503) (← links)
- Concurrent vs. exclusive reading in parallel decoding of LZ-compressed files (Q1662611) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- Lempel-Ziv data compression on parallel and distributed systems (Q1736484) (← links)
- Dynamic relative compression, dynamic partial sums, and substring concatenation (Q1755738) (← links)
- Computing the longest previous factor (Q1761495) (← links)
- Parallel Lempel Ziv coding (Q1764899) (← links)
- Approximation algorithms for the shortest common superstring problem (Q1822981) (← links)
- Collage system: A unifying framework for compressed pattern matching. (Q1874240) (← links)
- Colored operads, series on colored operads, and combinatorial generating systems (Q1999730) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Factorizing strings into repetitions (Q2135631) (← links)
- On the approximation ratio of LZ-end to LZ77 (Q2146133) (← links)
- A separation of \(\gamma\) and \(b\) via Thue-Morse words (Q2146136) (← links)
- On stricter reachable repetitiveness measures (Q2146140) (← links)
- Weighted forward looking adaptive coding (Q2166764) (← links)
- Lempel-Ziv-like parsing in small space (Q2205632) (← links)
- Block trees (Q2221797) (← links)
- Binary image compression via monochromatic pattern substitution: sequential and parallel implementations (Q2254061) (← links)
- Direct merging of delta encoded files (Q2295635) (← links)
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005) (← links)
- Compressed automata for dictionary matching (Q2344744) (← links)
- List partitions (Q2366166) (← links)
- A PTIME-complete matching problem for SLP-compressed words (Q2390207) (← links)
- Note on the greedy parsing optimality for dictionary-based text compression (Q2437746) (← links)
- Finding the smallest binarization of a CFG is NP-hard (Q2637648) (← links)
- Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
- LZRR: LZ77 parsing with right reference (Q2672241) (← links)
- Sensitivity of string compressors and repetitiveness measures (Q2687989) (← links)
- Bidirectional adaptive compression (Q2689643) (← links)
- FINDING CHARACTERISTIC SUBSTRINGS FROM COMPRESSED TEXTS (Q2909195) (← links)
- A new graph model and algorithms for consistent superstring problems <sup /> (Q2955630) (← links)
- Dictionary-Symbolwise Flexible Parsing (Q3000525) (← links)
- (Q3304145) (← links)
- Forty Years of Text Indexing (Q4928554) (← links)
- Redundancy estimates for the Lempel–Ziv algorithm of data compression (Q4936548) (← links)
- Mining Compressing Sequential Patterns (Q4969924) (← links)
