Linear Algorithm for Data Compression via String Matching
From MaRDI portal
Publication:3912479
DOI10.1145/322234.322237zbMath0462.94015OpenAlexW2017661493MaRDI QIDQ3912479
Shimon Even, Michael Rodeh, Vaughan R. Pratt
Publication date: 1981
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322234.322237
Analysis of algorithms and problem complexity (68Q25) Communication, information (94A99) Software, source code, etc. for problems pertaining to information and communication theory (94-04)
Related Items
Sublinear approximate string matching and biological applications, Order-preserving indexing, The use and usefulness of numeration systems, Finding approximate repetitions under Hamming distance., Truncated suffix trees and their application to data compression., Scalability and communication in parallel low-complexity lossless compression, Linear-time construction of two-dimensional suffix trees, Textual data compression in computational biology: algorithmic techniques, Block trees, Lempel-Ziv data compression on parallel and distributed systems, On-line string matching with feedback, Data compression with factor automata, Lempel-Ziv Factorization Revisited, On-line construction of two-dimensional suffix trees, Minimum cost multi-product flow lines, Computing the longest previous factor, Linear time algorithms for finding and representing all the tandem repeats in a string, Finite automata based algorithms on subsequences and supersequences of degenerate strings, Forty Years of Text Indexing, Linear-time computation of local periods, Optimal parallel suffix tree construction, Optimal encoding of non-stationary sources, Distance measures for biological sequences: some recent approaches, Redundancy estimates for the Lempel–Ziv algorithm of data compression, Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space, Optimal data compression algorithm, Approximation algorithms for the shortest common superstring problem, Universal Data Compression Algorithm Based on Approximate String Matching, Searching and encoding for infinite ordered sets, The smallest automaton recognizing the subwords of a text, Text compression methods
