Universal Data Compression Algorithm Based on Approximate String Matching (Q5485382): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal almost sure data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and data compression schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suffix Arrays: A New Method for On-Line String Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lempel-Ziv algorithm and message complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data structures and algorithms for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal codeword sets and representations of the integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding theorems for individual sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Individual Ergodic Theorem of Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4731122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Rényi strong law for pattern matching with a given proportion of mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Rényi law in distribution, for coin tossing and sequence matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for source coding subject to a fidelity criterion, based on string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sandwich proof of the Shannon-McMillan-Breiman theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression of individual sequences via variable-rate coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the notion of recurrence in discrete stochastic processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sliding-block source coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Algorithm for Data Compression via String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotical growth of a class of random trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Space-Economical Suffix Tree Construction Algorithm / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1017/s0269964800004502 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2104550348 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:13, 30 July 2024

scientific article; zbMATH DE number 5050646
Language Label Description Also known as
English
Universal Data Compression Algorithm Based on Approximate String Matching
scientific article; zbMATH DE number 5050646

    Statements

    Universal Data Compression Algorithm Based on Approximate String Matching (English)
    0 references
    0 references
    30 August 2006
    0 references
    0 references
    0 references
    0 references