Zapiski Nauchnykh Seminarov POMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Zapiski Nauchnykh Seminarov POMI, 2012, Volume 402, Pages 45–68 (Mi znsl5237)  
Efficient data compression by straight-line programs

I. S. Burmistrov, A. V. Kozlova, E. B. Kurpilyansky, A. A. Khvorost

Institute of Mathematics and Computer Science, Ural Federal University, Ekaterinburg, Russia
Full-text PDF (354 kB)
References:
PDF
HTML
Abstract: We present two algorithms that construct a context-free grammar for a given text. The first one is an improvement of Rytter's algorithm that constructs grammar using AVL-trees. The second one is a new approach that constructs grammar using cartesian trees. Also we compare both algorithms and Rytter's algorithm on various data sets and provide a comparative analysis of compression ratio achieved by these algorithms, by LZ77 and by LZW.
Key words and phrases: straight-line program, LZ-compression, AVL-tree, Cartesian tree.
Received: 17.05.2012
English version:
Journal of Mathematical Sciences (New York), 2013, Volume 192, Issue 3, Pages 282–294
DOI: https://doi.org/10.1007/s10958-013-1394-6
Bibliographic databases:
Document Type: Article
UDC: 519.256
Language: Russian
Citation: I. S. Burmistrov, A. V. Kozlova, E. B. Kurpilyansky, A. A. Khvorost, “Efficient data compression by straight-line programs”, Combinatorics and graph theory. Part IV, RuFiDiM'11, Zap. Nauchn. Sem. POMI, 402, POMI, St. Petersburg, 2012, 45–68; J. Math. Sci. (N. Y.), 192:3 (2013), 282–294
Citation in format AMSBIB
\Bibitem{BurKozKur12}
\by I.~S.~Burmistrov, A.~V.~Kozlova, E.~B.~Kurpilyansky, A.~A.~Khvorost
\paper Efficient data compression by straight-line programs
\inbook Combinatorics and graph theory. Part~IV
\bookinfo RuFiDiM'11
\serial Zap. Nauchn. Sem. POMI
\yr 2012
\vol 402
\pages 45--68
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl5237}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2981978}
\transl
\jour J. Math. Sci. (N. Y.)
\yr 2013
\vol 192
\issue 3
\pages 282--294
\crossref{https://doi.org/10.1007/s10958-013-1394-6}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84884985438}
Linking options:
  • https://www.mathnet.ru/eng/znsl5237
  • https://www.mathnet.ru/eng/znsl/v402/p45
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:201
    Full-text PDF :80
    References:37
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024