de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Approximation of Grammar-based Compression via Recompression

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons79297

Jeż,  Artur
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

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.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0015-3F30-C
Zusammenfassung
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.