Pages that link to "Item:Q4158937"
From MaRDI portal
The following pages link to A universal algorithm for sequential data compression (Q4158937):
Displaying 50 items.
- Bacterial DNA sequence compression models using artificial neural networks (Q280530) (← links)
- FM-index of alignment: a compressed index for similar strings (Q294964) (← links)
- A novel block-based scheme for arithmetic coding (Q296285) (← links)
- Optimal partitioning of data chunks in deduplication systems (Q313775) (← links)
- Straight-line programs: a practical test (extended abstract) (Q376125) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- Similarity in languages and programs (Q391201) (← links)
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case (Q396650) (← links)
- Compact q-gram profiling of compressed strings (Q401308) (← links)
- Convergence of recurrence of blocks for mixing processes (Q411701) (← links)
- The three squares lemma revisited (Q414439) (← links)
- Efficient algorithms for three variants of the LPF table (Q414447) (← links)
- Quasi-distinct parsing and optimal compression methods (Q417983) (← links)
- Fast equality test for straight-line compressed strings (Q436321) (← links)
- Personalized multi-user view and content synchronization and retrieval in real-time mobile social software applications (Q439982) (← links)
- Parameterized longest previous factor (Q441845) (← links)
- Impugning randomness, convincingly (Q454396) (← links)
- A sensor-based framework for kinetic data compression (Q482331) (← links)
- The greedy approach to dictionary-based static text compression on a distributed system (Q491153) (← links)
- Practical fixed length Lempel-Ziv coding (Q496549) (← links)
- Compressed subsequence matching and packed tree coloring (Q513266) (← links)
- Disjunctivity and other properties of sets of pseudo-bordered words (Q530214) (← links)
- Balancing and clustering of words in the Burrows-Wheeler transform (Q544888) (← links)
- On the algorithmic complexity of static structures (Q545415) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Leaf languages and string compression (Q550251) (← links)
- An efficient algorithm for sequence comparison with block reversals (Q596144) (← links)
- Scalability and communication in parallel low-complexity lossless compression (Q626896) (← links)
- A fast dynamic compression scheme for natural language texts (Q630711) (← links)
- Algorithmic folding complexity (Q659709) (← links)
- On-line versus off-line computation in dynamic text compression (Q671415) (← links)
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees (Q672989) (← links)
- Is Huffmann coding dead? (Q685866) (← links)
- On bounded redundancy of universal codes (Q712553) (← links)
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words (Q716329) (← links)
- An empirical study of the complexity and randomness of prediction error sequences (Q718610) (← links)
- LZ77 computation based on the run-length encoded BWT (Q724214) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- Hydrozip: how hydrological knowledge can be used to improve compression of hydrological data (Q742695) (← links)
- A compressed dynamic self-index for highly repetitive text collections (Q776840) (← links)
- A review on the application of fuzzy transform in data and image compression (Q780186) (← links)
- Text compression methods (Q805263) (← links)
- Speeding up HMM decoding and training by exploiting sequence repetitions (Q834590) (← links)
- Faster subsequence recognition in compressed strings (Q843615) (← links)
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates (Q846172) (← links)
- A universal online caching algorithm based on pattern matching (Q848635) (← links)
- Phase transition in a generalized Eden growth model on a tree (Q858046) (← links)
- Replacing suffix trees with enhanced suffix arrays (Q876707) (← links)
- Adaptive text mining: inferring structure from sequences (Q876712) (← links)
- Practical and flexible pattern matching over Ziv-Lempel compressed text. (Q878012) (← links)
