Algorithms on grammar-compressed strings

Gad M. Landau

doi:10.1007/978-3-642-21458-5_1

Algorithms on grammar-compressed strings

Gad M. Landau

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Proceedings
Pages	1
Number of pages	1
DOIs	https://doi.org/10.1007/978-3-642-21458-5_1
State	Published - 2011
Event	22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011 - Palermo, Italy Duration: 27 Jun 2011 → 29 Jun 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6661 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011
Country/Territory	Italy
City	Palermo
Period	27/06/11 → 29/06/11

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-21458-5_1

Cite this

@inproceedings{49537b2b25a84296b2a1480b908ae6df,

title = "Algorithms on grammar-compressed strings",

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.",

author = "Landau, {Gad M.}",

year = "2011",

doi = "10.1007/978-3-642-21458-5_1",

language = "English",

isbn = "9783642214578",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "1",

booktitle = "Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Proceedings",

note = "22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011 ; Conference date: 27-06-2011 Through 29-06-2011",

}

Landau, GM 2011, Algorithms on grammar-compressed strings. in Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6661 LNCS, pp. 1, 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011, Palermo, Italy, 27/06/11. https://doi.org/10.1007/978-3-642-21458-5_1

Algorithms on grammar-compressed strings. / Landau, Gad M.
Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Proceedings. 2011. p. 1 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6661 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Algorithms on grammar-compressed strings

AU - Landau, Gad M.

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79960087459&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-21458-5_1

DO - 10.1007/978-3-642-21458-5_1

M3 - Conference contribution

AN - SCOPUS:79960087459

SN - 9783642214578

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

BT - Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Proceedings

T2 - 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011

Y2 - 27 June 2011 through 29 June 2011

ER -

Algorithms on grammar-compressed strings

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this