Skip to main content
Conference ProceedingsOPEN ACCESS

Algorithms on grammar-compressed strings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6661 LNCS 1
DOI: 10.1007/978-3-642-21458-5_1
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Grammar based compression, where one replaces a long string by a small contextfree grammar that generates the string, is a simple and powerful paradigm that captures many of the popular compression schemes, including the Lempel-Ziv family, Run-Length Encoding, Byte-Pair Encoding, Sequitur and Re-Pair. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Landau, G. M. (2011). Algorithms on grammar-compressed strings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6661 LNCS, p. 1). https://doi.org/10.1007/978-3-642-21458-5_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free