Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes

被引：0
|
作者：
Aratsu, Taku [1 ]
Hirata, Kouichi [1 ]
Kuboyama, Tetsuji [2 ]
机构：
[1] Kyushu Inst Technol, Dept Artificial Intelligence, Kawazu 680-4, Iizuka, Fukuoka 8208502, Japan
[2] Gakushuin Univ, Ctr Comp, Toshima Ku, Tokyo, Japan
来源：
SOFSEM 2009-THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS | 2009年 / 5404卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we give an approximation of the tree edit distance through the string edit distance for binary tree. codes, instead of one for Euler strings introduced by Akutsu (2006). Here, a binary tree code is a string obtained by traversing a binary tree representation with two kinds of dummy nodes of a tree in preorder. Then, we show that sigma/2 <= tau <= (h + 1)sigma + h, where tau is the tree edit distance between trees, sigma is the string edit distance between their binary tree codes and It is the minimum height of the trees.
引用
收藏
页码：93 / +
页数：3
相关论文
共 50 条
  • [31] Extend tree edit distance for effective object identification
    Wang, Yue
    Wang, Hongzhi
    Zhang, Liyan
    Wang, Yang
    Li, Jianzhong
    Gao, Hong
    KNOWLEDGE AND INFORMATION SYSTEMS, 2016, 46 (03) : 629 - 656
  • [32] Phylogenetic tree reconstruction based on normalized edit distance
    Li, Yu-Jian
    Wang, Fang-Yuan
    Beijing Gongye Daxue Xuebao / Journal of Beijing University of Technology, 2008, 34 (11): : 1211 - 1215
  • [33] Computing Text Similarity using Tree Edit Distance
    Sidorov, Grigori
    Gomez-Adorno, Helena
    Markov, Ilia
    Pinto, David
    Loya, Nahun
    2015 ANNUAL MEETING OF THE NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY DIGIPEN NAFIPS 2015, 2015,
  • [34] Clustering of Synthetic Routes Using Tree Edit Distance
    Genheden, Samuel
    Engkvist, Ola
    Bjerrum, Esben
    JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2021, 61 (08) : 3899 - 3907
  • [35] Breaking the Cubic Barrier for (Unweighted) Tree Edit Distance
    Mao, Xiao
    2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 792 - 803
  • [36] TRACTABLE AND INTRACTABLE VARIATIONS OF UNORDERED TREE EDIT DISTANCE
    Yamamoto, Yoshiyuki
    Hirata, Kouichi
    Kuboyama, Tetsuji
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2014, 25 (03) : 307 - 329
  • [37] Tree Edit Distance as a Baseline Approach for Paraphrase Representation
    Vila, Marta
    Dras, Mark
    PROCESAMIENTO DEL LENGUAJE NATURAL, 2012, (48): : 89 - 95
  • [38] Tree edit distance: Robust and memory-efficient
    Pawlik, Mateusz
    Augsten, Nikolaus
    INFORMATION SYSTEMS, 2016, 56 : 157 - 173
  • [39] Extend tree edit distance for effective object identification
    Yue Wang
    Hongzhi Wang
    Liyan Zhang
    Yang Wang
    Jianzhong Li
    Hong Gao
    Knowledge and Information Systems, 2016, 46 : 629 - 656
  • [40] Tree Edit Distance Problems: Algorithms and Applications to Bioinformatics
    Akutsu, Tatsuya
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2010, E93D (02): : 208 - 218
12345