Improving static compression schemes by alphabet extension

Shmuel T. Klein

doi:10.1007/3-540-45123-4_19

Improving static compression schemes by alphabet extension

Shmuel T. Klein

Department of Mathematics

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

6 Scopus citations

Abstract

The performance of data compression on a large static text may be improved if certain variable-length strings are included in the character set for which a code is generated. A new method for extending the alphabet is presented, based on a reduction to a graph-theoretic problem. A related optimization problem is shown to be NP-complete, a fast heuristic is suggested, and experimental results are presented.

Original language	English
Title of host publication	Combinatorial Pattern Matching - 11th Annual Symposium, CPM 2000, Proceedings
Editors	Raffaele Giancarlo, David Sankoff
Publisher	Springer Verlag
Pages	210-221
Number of pages	12
ISBN (Electronic)	3540676333, 9783540676331
DOIs	https://doi.org/10.1007/3-540-45123-4_19
State	Published - 2000
Event	11th Annual Symposium on Combinatorial Pattern Matching, CPM 2000 - Montreal, Canada Duration: 21 Jun 2000 → 23 Jun 2000

Publication series

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

Conference

Conference	11th Annual Symposium on Combinatorial Pattern Matching, CPM 2000
Country/Territory	Canada
City	Montreal
Period	21/06/00 → 23/06/00

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.

Access to Document

10.1007/3-540-45123-4_19

Cite this

Klein, S. T. (2000). Improving static compression schemes by alphabet extension. In R. Giancarlo, & D. Sankoff (Eds.), Combinatorial Pattern Matching - 11th Annual Symposium, CPM 2000, Proceedings (pp. 210-221). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1848). Springer Verlag. https://doi.org/10.1007/3-540-45123-4_19

Klein, Shmuel T. / Improving static compression schemes by alphabet extension. Combinatorial Pattern Matching - 11th Annual Symposium, CPM 2000, Proceedings. editor / Raffaele Giancarlo ; David Sankoff. Springer Verlag, 2000. pp. 210-221 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{26ad5703e89f4fefbca7559d0d964dc4,

title = "Improving static compression schemes by alphabet extension",

abstract = "The performance of data compression on a large static text may be improved if certain variable-length strings are included in the character set for which a code is generated. A new method for extending the alphabet is presented, based on a reduction to a graph-theoretic problem. A related optimization problem is shown to be NP-complete, a fast heuristic is suggested, and experimental results are presented.",

author = "Klein, {Shmuel T.}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 11th Annual Symposium on Combinatorial Pattern Matching, CPM 2000 ; Conference date: 21-06-2000 Through 23-06-2000",

year = "2000",

doi = "10.1007/3-540-45123-4_19",

language = "אנגלית",

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

publisher = "Springer Verlag",

pages = "210--221",

editor = "Raffaele Giancarlo and David Sankoff",

booktitle = "Combinatorial Pattern Matching - 11th Annual Symposium, CPM 2000, Proceedings",

address = "גרמניה",

}

Klein, ST 2000, Improving static compression schemes by alphabet extension. in R Giancarlo & D Sankoff (eds), Combinatorial Pattern Matching - 11th Annual Symposium, CPM 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1848, Springer Verlag, pp. 210-221, 11th Annual Symposium on Combinatorial Pattern Matching, CPM 2000, Montreal, Canada, 21/06/00. https://doi.org/10.1007/3-540-45123-4_19

Improving static compression schemes by alphabet extension. / Klein, Shmuel T.
Combinatorial Pattern Matching - 11th Annual Symposium, CPM 2000, Proceedings. ed. / Raffaele Giancarlo; David Sankoff. Springer Verlag, 2000. p. 210-221 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1848).

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

TY - GEN

T1 - Improving static compression schemes by alphabet extension

AU - Klein, Shmuel T.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2000.

PY - 2000

Y1 - 2000

N2 - The performance of data compression on a large static text may be improved if certain variable-length strings are included in the character set for which a code is generated. A new method for extending the alphabet is presented, based on a reduction to a graph-theoretic problem. A related optimization problem is shown to be NP-complete, a fast heuristic is suggested, and experimental results are presented.

AB - The performance of data compression on a large static text may be improved if certain variable-length strings are included in the character set for which a code is generated. A new method for extending the alphabet is presented, based on a reduction to a graph-theoretic problem. A related optimization problem is shown to be NP-complete, a fast heuristic is suggested, and experimental results are presented.

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

U2 - 10.1007/3-540-45123-4_19

DO - 10.1007/3-540-45123-4_19

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84871225837

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

SP - 210

EP - 221

BT - Combinatorial Pattern Matching - 11th Annual Symposium, CPM 2000, Proceedings

A2 - Giancarlo, Raffaele

A2 - Sankoff, David

PB - Springer Verlag

T2 - 11th Annual Symposium on Combinatorial Pattern Matching, CPM 2000

Y2 - 21 June 2000 through 23 June 2000

ER -

Klein ST. Improving static compression schemes by alphabet extension. In Giancarlo R, Sankoff D, editors, Combinatorial Pattern Matching - 11th Annual Symposium, CPM 2000, Proceedings. Springer Verlag. 2000. p. 210-221. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45123-4_19

Improving static compression schemes by alphabet extension

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this