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.
- Progress, gaps and obstacles in the classification of cellular automata (Q2670224) (← links)
- c-trie++: a dynamic trie tailored for fast prefix searches (Q2672225) (← links)
- Predictability of players' actions as a mechanism to boost cooperation (Q2680068) (← links)
- Recurrence times, waiting times and universal entropy production estimators (Q2687713) (← links)
- Sensitivity of string compressors and repetitiveness measures (Q2687989) (← links)
- Fast string matching for multiple searches (Q2745228) (← links)
- Convergence properties of functional estimates for discrete distributions (Q2772919) (← links)
- Size and path length of Patricia tries: Dynamical sources context (Q2772922) (← links)
- Second step algorithms in the Burrows-Wheeler compression algorithm (Q2783312) (← links)
- On the non-randomness of maximum Lempel Ziv complexity sequences of finite size (Q2787836) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- On the compression of locational and environmental data in multi-vehicle missions: a control systems approach (Q2868817) (← links)
- Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts (Q2891377) (← links)
- Finding characteristic substrings from compressed texts (Q2909195) (← links)
- Composite Repetition-Aware Data Structures (Q2942243) (← links)
- Lempel Ziv Computation in Small Space (LZ-CISS) (Q2942255) (← links)
- An Opportunistic Text Indexing Structure Based on Run Length Encoding (Q2947038) (← links)
- A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String (Q2949836) (← links)
- Hybrid indexes for repetitive datasets (Q2955636) (← links)
- Large-scale detection of repetitions (Q2955637) (← links)
- Entropy estimate by a randomness criterion (Q2986622) (← links)
- Compressed Membership in Automata with Compressed Labels (Q3007633) (← links)
- Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition (Q3007644) (← links)
- Self-indexing Based on LZ77 (Q3011842) (← links)
- Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts (Q3011864) (← links)
- Estimating Entropy Rates with Bayesian Confidence Intervals (Q3025070) (← links)
- COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA (Q3056281) (← links)
- Congruence Closure of Compressed Terms in Polynomial Time (Q3172897) (← links)
- Self-indexed Text Compression Using Straight-Line Programs (Q3182928) (← links)
- Minimal Unique Substrings and Minimal Absent Words in a Sliding Window (Q3297764) (← links)
- Relative entropy via non-sequential recursive pair substitution (Q3301194) (← links)
- Relations between greedy and bit-optimal LZ77 encodings (Q3304145) (← links)
- De Novo NGS Data Compression (Q3305522) (← links)
- CONVERGENCE OF C<sub>0</sub> COMPLEXITY (Q3391948) (← links)
- Bridging Lossy and Lossless Compression by Motif Pattern Discovery (Q3439250) (← links)
- Arithmetics on Suffix Arrays of Fibonacci Words (Q3449364) (← links)
- Diverse Palindromic Factorization Is NP-complete (Q3451091) (← links)
- Approximating LZ77 via Small-Space Multiple-Pattern Matching (Q3452816) (← links)
- Compressed Data Structures for Dynamic Sequences (Q3452849) (← links)
- USING ALIGNMENT FOR MULTILINGUAL TEXT COMPRESSION (Q3532142) (← links)
- An Online Algorithm for Finding the Longest Previous Factors (Q3541131) (← links)
- The Vcodex Platform for Data Compression (Q3612878) (← links)
- An example of mathematical authorship attribution (Q3624671) (← links)
- Statistical physics approach to categorize biologic signals: From heart rate dynamics to DNA sequences (Q3624753) (← links)
- Quasi-distinct Parsing and Optimal Compression Methods (Q3637102) (← links)
- On the Value of Multiple Read/Write Streams for Data Compression (Q3637105) (← links)
- Improved variations relating the Ziv-Lempel and Welch-type algorithms for sequential data compression (Q3991389) (← links)
- Fast Exponentiation Using Data Compression (Q4210171) (← links)
- (Q4279502) (← links)
- Universal lossless compression via multilevel pattern matching (Q4501756) (← links)
