Information compression by factorising common strings
From MaRDI portal
Publication:4054659
DOI10.1093/comjnl/18.2.157zbMath0299.68021OpenAlexW2154259526MaRDI QIDQ4054659
Publication date: 1975
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/18.2.157
Related Items (3)
Approximation algorithms for the shortest common superstring problem ⋮ A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem ⋮ Text compression methods
This page was built for publication: Information compression by factorising common strings