Information compression by factorising common strings

DOI10.1093/COMJNL/18.2.157MaRDI QIDQ4054659zbMATH OpenOpenAlexFDO

Authors Alan J. Mayne, E. B. James

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4054659)