Analysis of tree edit distance algorithms

被引：0
|
作者：
Dulucq, S [1 ]
Touzet, H
机构：
[1] Univ Bordeaux 1, LaBRI, F-33405 Talence, France
[2] Univ Lille 1, LIFL, F-59655 Villeneuve Dascq, France
来源：
COMBINATORIAL PATTERN MATCHING, PROCEEDINGS | 2003年 / 2676卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this article; we study the behaviour of dynamic programming methods for the tree edit distance problem, such as [4] and [2]. We show that those two algorithms may: be described in a more general framework of cover strategies. This analysis allows us to; define a new tree edit distance algorithm, that is optimal for cover strategies.
引用
收藏
页码：83 / 95
页数：13
相关论文
共 50 条
  • [1] Decomposition algorithms for the tree edit distance problem
    Dulucq, Serge
    Touzet, Helene
    JOURNAL OF DISCRETE ALGORITHMS, 2005, 3 (2-4) : 448 - 471
  • [2] Faster algorithms for guided tree edit distance
    Tsur, Dekel
    INFORMATION PROCESSING LETTERS, 2008, 108 (04) : 251 - 254
  • [3] Tree Edit Distance Problems: Algorithms and Applications to Bioinformatics
    Akutsu, Tatsuya
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2010, E93D (02): : 208 - 218
  • [4] Theoretical Analysis of Edit Distance Algorithms
    Medvedev, Paul
    COMMUNICATIONS OF THE ACM, 2023, 66 (12) : 64 - 71
  • [5] Analysis of tree edit distance on XML data
    Wu, Yu-Fang
    Lin, Shu-Fen
    Yen, Hsu-Chun
    PROCEEDINGS OF THE SIXTH IASTED INTERNATIONAL CONFERENCE ON COMMUNICATIONS, INTERNET, AND INFORMATION TECHNOLOGY, 2007, : 5 - 10
  • [6] Approximating tree edit distance through string edit distance
    Akutsu, Tatsuya
    Fukagawa, Daiji
    Takasu, Atsuhiro
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2006, 4288 : 90 - +
  • [7] Approximating Tree Edit Distance through String Edit Distance
    Akutsu, Tatsuya
    Fukagawa, Daiji
    Takasu, Atsuhiro
    ALGORITHMICA, 2010, 57 (02) : 325 - 348
  • [8] Approximating Tree Edit Distance through String Edit Distance
    Tatsuya Akutsu
    Daiji Fukagawa
    Atsuhiro Takasu
    Algorithmica, 2010, 57 : 325 - 348
  • [9] Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
    Aratsu, Taku
    Hirata, Kouichi
    Kuboyama, Tetsuji
    FUNDAMENTA INFORMATICAE, 2010, 101 (03) : 157 - 171
  • [10] Exact algorithms for computing the tree edit distance between unordered trees
    Akutsu, Tatsuya
    Fukagawa, Daiji
    Takasu, Atsuhiro
    Tamura, Takeyuki
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (4-5) : 352 - 364
12345