Abstract
Relative Lempel-Ziv is a popular algorithm designed to compress sets of strings relative to a given reference string, which acts as a kind of dictionary. It can still applied even when there is no obvious natural reference string for a dataset, by sampling substrings from the dataset and concatenating them to obtain an artificial reference. This works well in practice but a theoretical analysis has been lacking. In this paper we provide such an analysis and verify it experimentally.
Cite
CITATION STYLE
Gagie, T., Puglisi, S. J., & Valenzuela, D. (2016). Analyzing relative lempel-Ziv reference construction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9954 LNCS, pp. 160–165). Springer Verlag. https://doi.org/10.1007/978-3-319-46049-9_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
