Grammar-Based Compression of Unranked Trees

被引：1
|
作者：
Gascon, Adria [1 ,2 ]
Lohrey, Markus [3 ]
Maneth, Sebastian [4 ]
Reh, Carl Philipp [3 ]
Sieber, Kurt [3 ]
机构：
[1] Univ Warwick, Coventry, W Midlands, England
[2] Alan Turing Inst, London, England
[3] Univ Siegen, Siegen, Germany
[4] Univ Bremen, Bremen, Germany
来源：
THEORY OF COMPUTING SYSTEMS | 2020年 / 64卷 / 01期
基金：
英国工程与自然科学研究理事会;
关键词：
Grammar-based tree compression; Top dags; Equality testing; Forest; UNORDERED XML;
D O I：
10.1007/s00224-019-09942-y
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We introduce forest straight-line programs (FSLPs for short) as a compressed representation of unranked ordered node-labelled trees. FSLPs are based on the operations of forest algebra and generalize tree straight-line programs. We compare the succinctness of FSLPs with two other compression schemes for unranked trees: top dags and tree straight-line programs of first-child/next sibling encodings. Efficient translations between these formalisms are provided. Finally, we show that equality of unranked trees in the setting where certain symbols are associative and/or commutative can be tested in polynomial time. This generalizes previous results for testing isomorphism of compressed unordered ranked trees. An extended abstract of this paper appeared in Gascoon et al. (2018).
引用
收藏
页码：141 / 176
页数：36
相关论文
共 50 条
  • [31] Universal Tree Source Coding Using Grammar-Based Compression
    Ganardi, Moses
    Hucke, Danny
    Lohrey, Markus
    Benkner, Louisa Seelbach
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (10) : 6399 - 6413
  • [32] A Grammar-Based Compression Using a Variation of Chomsky Normal Form of Context Free Grammar
    Arimura, Mitsuharu
    PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016), 2016, : 246 - 250
  • [33] Improving grammar-based evolutionary algorithms via attributed derivation trees
    Zvada, S
    Vanyi, B
    GENETIC PROGRAMMING, PROCEEDINGS, 2004, 3003 : 208 - 219
  • [34] Grammar-based Fuzzing
    Sargsyan, Sevak
    Kurmangaleev, Shamil
    Mehrabyan, Matevos
    Mishechkin, Maksim
    Ghukasyan, Tsolak
    Asryan, Sergey
    2018 IVANNIKOV MEMORIAL WORKSHOP (IVMEM 2018), 2018, : 32 - 35
  • [35] Application of Lempel-Ziv factorization to the approximation of grammar-based compression
    Rytter, W
    COMBINATORIAL PATTERN MATCHING, 2002, 2373 : 20 - 31
  • [36] Application of Lempel-Ziv factorization to the approximation of grammar-based compression
    Rytter, W
    THEORETICAL COMPUTER SCIENCE, 2003, 302 (1-3) : 211 - 222
  • [37] A fully linear-time approximation algorithm for grammar-based compression
    Sakamoto, Hiroshi
    JOURNAL OF DISCRETE ALGORITHMS, 2005, 3 (2-4) : 416 - 430
  • [38] Grammar-based compression using multi-phase hierarchical segmentation
    Akimov, A
    Fränti, P
    Proceedings of the Fourth IASTED International Conference on Visualization, Imaging, and Image Processing, 2004, : 364 - 368
  • [39] A fully linear-time approximation algorithm for grammar-based compression
    Sakamoto, H
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2003, 2676 : 348 - 360
  • [40] Grammar-based Encoding of Facades
    Haegler, Simon
    Wonka, Peter
    Arisona, Stefan Mueller
    Van Gool, Luc
    Mueller, Pascal
    COMPUTER GRAPHICS FORUM, 2010, 29 (04) : 1479 - 1487
12345