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 条
  • [41] Grammar-based Whitebox Fuzzing
    Godefroid, Patrice
    Kiezun, Adam
    Levin, Michael Y.
    [J]. PLDI'08: PROCEEDINGS OF THE 2008 SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN & IMPLEMENTATION, 2008, : 206 - +
  • [42] Grammar-based immune programming
    Bernardino, Heder S.
    Barbosa, Helio J. C.
    [J]. NATURAL COMPUTING, 2011, 10 (01) : 209 - 241
  • [43] Grammar-based whitebox fuzzing
    Godefroid, Patrice
    Kiezun, Adam
    Levin, Michael Y.
    [J]. ACM SIGPLAN NOTICES, 2008, 43 (06) : 206 - 215
  • [44] Grammar-based immune programming
    Heder S. Bernardino
    Helio J. C. Barbosa
    [J]. Natural Computing, 2011, 10 : 209 - 241
  • [45] Variable-Length Codes for Space-Efficient Grammar-Based Compression
    Takabatake, Yoshimasa
    Tabei, Yasuo
    Sakamoto, Hiroshi
    [J]. STRING PROCESSING AND INFORMATION RETRIEVAL: 19TH INTERNATIONAL SYMPOSIUM, SPIRE 2012, 2012, 7608 : 398 - 410
  • [46] RNACompress: Grammar-based compression and informational complexity measurement of RNA secondary structure
    Qi Liu
    Yu Yang
    Chun Chen
    Jiajun Bu
    Yin Zhang
    Xiuzi Ye
    [J]. BMC Bioinformatics, 9
  • [47] A space-saving linear-time algorithm for grammar-based compression
    Sakamoto, H
    Kida, T
    Shimozono, S
    [J]. STRING PROCESSING AND INFORMATION RETRIEVAL, PROCEEDINGS, 2004, 3246 : 218 - 229
  • [48] Measuring the Similarity of Proteomes using Grammar-based Compression via Domain Combinations
    Hayashida, Morihiro
    Koyano, Hitoshi
    Nacher, Jose C.
    [J]. PROCEEDINGS OF THE 13TH INTERNATIONAL JOINT CONFERENCE ON BIOMEDICAL ENGINEERING SYSTEMS AND TECHNOLOGIES, VOL 3: BIOINFORMATICS, 2020, : 117 - 122
  • [49] RNACompress: Grammar-based compression and informational complexity measurement of RNA secondary structure
    Liu, Qi
    Yang, Yu
    Chen, Chun
    Bu, Jiajun
    Zhang, Yin
    Ye, Xiuzi
    [J]. BMC BIOINFORMATICS, 2008, 9 (1)
  • [50] Enumerating grammar-based extractions
    Peterfreund, Liat
    [J]. DISCRETE APPLIED MATHEMATICS, 2023, 341 : 372 - 392
12345