English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Approximation of Grammar-based Compression via Recompression

Jeż, A. (2013). Approximation of Grammar-based Compression via Recompression. In J. Fischer, & P. Sanders (Eds.), Combinatorial Pattern Matching (pp. 165-176). Berlin: Springer. doi:10.1007/978-3-642-38905-4_17.

Item is

Files

show Files
hide Files
:
grammar_CPM.pdf (Any fulltext), 334KB
 
File Permalink:
-
Name:
grammar_CPM.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Jeż, Artur1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: We present a simple linear-time algorithm constructing a~context-free grammar of size O(g \log (N/g)) for the input string of size N, where g the size of the optimal grammar generating this string. The algorithm works for arbitrary size alphabets, but the running time is linear assuming that the alphabet Σ of the input string is a subset of 1,\ldots , N^c for some constant c. Algorithms with such an approximation guarantees and running time are known, the novelty of this paper is the particular simplicity of the algorithm as well as the analysis of the algorithm, which uses a general technique of recompression recently introduced by the author. Furthermore, contrary to the previous results, this work does not use the LZ representation of the input string in the construction, nor in the analysis.

Details

show
hide
Language(s): eng - English
 Dates: 2013-062013
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1007/978-3-642-38905-4_17
BibTex Citekey: Jez2013CPM
Other: Local-ID: B144EE3C8FD0E4EDC1257C67004E4DA8-Jez2013CPM
 Degree: -

Event

show
hide
Title: 24th Annual Symposium on Combinatorial Pattern Matching
Place of Event: Bad Herrenalb, Germany
Start-/End Date: 2013-06-17 - 2013-06-19

Legal Case

show

Project information

show

Source 1

show
hide
Title: Combinatorial Pattern Matching
  Abbreviation : CPM 2013
  Subtitle : 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings
Source Genre: Proceedings
 Creator(s):
Fischer, Johannes1, Editor
Sanders, Peter1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 165 - 176 Identifier: ISBN: 978-3-642-38904-7

Source 2

show
hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 7922 Sequence Number: - Start / End Page: - Identifier: ISSN: 0302-9743