Data compression via textual substitution
From MaRDI portal
Cited in
(83)- On updating suffix tree labels
- P-complete problems in data compression
- Truncated suffix trees and their application to data compression.
- Comparison of LZ77-type parsings
- Concurrent vs. exclusive reading in parallel decoding of LZ-compressed files
- Universal compressed text indexing
- Lempel-Ziv data compression on parallel and distributed systems
- Dynamic relative compression, dynamic partial sums, and substring concatenation
- Computing the longest previous factor
- Parallel Lempel Ziv coding
- Approximation algorithms for the shortest common superstring problem
- Collage system: A unifying framework for compressed pattern matching.
- Colored operads, series on colored operads, and combinatorial generating systems
- On the complexity of the smallest grammar problem over fixed alphabets
- Factorizing strings into repetitions
- On the approximation ratio of LZ-end to LZ77
- A separation of \(\gamma\) and \(b\) via Thue-Morse words
- On stricter reachable repetitiveness measures
- Weighted forward looking adaptive coding
- Lempel-Ziv-like parsing in small space
- Block trees
- Binary image compression via monochromatic pattern substitution: sequential and parallel implementations
- Direct merging of delta encoded files
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
- Compressed automata for dictionary matching
- List partitions
- A PTIME-complete matching problem for SLP-compressed words
- Note on the greedy parsing optimality for dictionary-based text compression
- Finding the smallest binarization of a CFG is NP-hard
- Grammar-compressed indexes with logarithmic search time
- LZRR: LZ77 parsing with right reference
- Sensitivity of string compressors and repetitiveness measures
- Bidirectional adaptive compression
- Finding characteristic substrings from compressed texts
- A new graph model and algorithms for consistent superstring problems
- Dictionary-symbolwise flexible parsing
- Relations between greedy and bit-optimal LZ77 encodings
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
- Recognition of overlap graphs
- Dictionary-symbolwise flexible parsing
- Using static suffix array in dynamic application: case of text compression by longest first substitution
- Forty Years of Text Indexing
- Redundancy estimates for the Lempel–Ziv algorithm of data compression
- Practical fixed length Lempel-Ziv coding
- Mining Compressing Sequential Patterns
- String attractors: verification and optimization
- Bidirectional Text Compression in External Memory
- Optimal rank and select queries on dictionary-compressed text
- A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS
- SEMI-LOSSLESS TEXT COMPRESSION
- Forward looking Huffman coding
- Data compression with long repeated strings
- Optimal encoding of non-stationary sources
- \(LZ\)-based image compression
- scientific article; zbMATH DE number 7765406 (Why is no real title available?)
- String Indexing with Compressed Patterns
- Substring complexities on run-length compressed strings
- Random access in persistent strings and segment selection
- Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing
- Approximation ratios of \textsf{RePair}, \textsf{LongestMatch} and \textsf{Greedy} on unary strings
- Rpair: rescaling RePair with Rsync
- Sublinear time Lempel-Ziv (LZ77) factorization
- New advances in rightmost Lempel-Ziv
- Largest repetition factorization of Fibonacci words
- Iterated straight-line programs
- Selective dynamic compression
- On the number of equal-letter runs of the bijective Burrows-Wheeler transform
- Tight bounds for compressing substring samples
- Maintaining the size of LZ77 on semi-dynamic strings
- Computing NP-hard repetitiveness measures via MAX-SAT
- Repetitiveness measures based on string morphisms
- Constant-delay enumeration for SLP-compressed documents
- Generalized straight-line programs
- On the complexity and approximability of bounded access Lempel Ziv coding
- Generalization of repetitiveness measures for two-dimensional strings
- Lempel-Ziv factorization powered by space efficient suffix trees
- Re^2Pair: increasing the scalability of repair by decreasing memory usage
- Counting on general run-length grammars
- On the compressiveness of the Burrows-Wheeler transform
- Text compression methods
- Novel results on the number of runs of the Burrows-Wheeler-transform
- Compressed parameterized pattern matching
- Finding the longest common nonsuperstring in linear time
This page was built for publication: Data compression via textual substitution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3951542)
