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 条
  • [21] Comparative Analysis of Merge Trees Using Local Tree Edit Distance
    Sridharamurthy, Raghavendra
    Natarajan, Vijay
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2023, 29 (02) : 1518 - 1530
  • [22] An Optimal Decomposition Algorithm for Tree Edit Distance
    Demaine, Erik D.
    Mozes, Shay
    Rossman, Benjamin
    Weimann, Oren
    ACM TRANSACTIONS ON ALGORITHMS, 2009, 6 (01)
  • [23] Graph Edit Distance Compacted Search Tree
    Chegrane, Ibrahim
    Hocine, Imane
    Yahiaoui, Said
    Bendjoudi, Ahcene
    Nouali-Taboudjemat, Nadia
    SIMILARITY SEARCH AND APPLICATIONS (SISAP 2022), 2022, 13590 : 181 - 189
  • [24] Analyzing edit distance on trees: Tree swap distance is intractable
    Department of Computing Science, Umeå University, 90187 Umeå, Sweden
    Proc. Prag. Str. Conf., (59-73):
  • [25] Tree edit distance from information theory
    Torsello, A
    Hancock, ER
    GRAPH BASED REPRESENTATIONS IN PATTERN RECOGNITION, PROCEEDINGS, 2003, 2726 : 71 - 82
  • [26] An optimal decomposition algorithm for tree edit distance
    Demaine, Erik D.
    Mozes, Shay
    Rossman, Benjamin
    Weimann, Oren
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 146 - +
  • [27] Tree Edit Distance and Maximum Agreement Subtree
    Shin, Kilho
    INFORMATION PROCESSING LETTERS, 2015, 115 (01) : 69 - 73
  • [28] A survey on tree edit distance and related problems
    Bille, P
    THEORETICAL COMPUTER SCIENCE, 2005, 337 (1-3) : 217 - 239
  • [29] RTED: A Robust Algorithm for the Tree Edit Distance
    Pawlik, Mateusz
    Augsten, Nikolaus
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2011, 5 (04): : 334 - 345
  • [30] Learning probabilistic models of tree edit distance
    Bernard, Marc
    Boyer, Laurent
    Habrard, Amaury
    Sebban, Marc
    PATTERN RECOGNITION, 2008, 41 (08) : 2611 - 2629
12345