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 条
  • [41] 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
  • [42] Tree Edit Distance as a Baseline Approach for Paraphrase Representation
    Vila, Marta
    Dras, Mark
    PROCESAMIENTO DEL LENGUAJE NATURAL, 2012, (48): : 89 - 95
  • [43] Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance
    Saks, Michael
    Seshadhri, C.
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 1698 - 1709
  • [44] Tree edit distance: Robust and memory-efficient
    Pawlik, Mateusz
    Augsten, Nikolaus
    INFORMATION SYSTEMS, 2016, 56 : 157 - 173
  • [45] 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
  • [46] Improved Algorithms for Finding Edit Distance Based Motifs
    Pal, Soumitra
    Rajasekaran, Sanguthevar
    PROCEEDINGS 2015 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE, 2015, : 537 - 542
  • [47] Fast suboptimal algorithms for the computation of graph edit distance
    Neuhaus, Michel
    Riesen, Kaspar
    Bunke, Horst
    STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, PROCEEDINGS, 2006, 4109 : 163 - 172
  • [48] An A*-algorithm for the Unordered Tree Edit Distance with Custom Costs
    Paassen, Benjamin
    SIMILARITY SEARCH AND APPLICATIONS, SISAP 2021, 2021, 13058 : 364 - 371
  • [49] Data compression of ECG based on the edit distance algorithms
    Morita, Hiroyoshi
    Kobayashi, Kingo
    IEICE Transactions on Information and Systems, 1993, E76-D (12) : 1443 - 1453
  • [50] Top-Down Tree Edit-Distance of Regular Tree Languages
    Ko, Sang-Ki
    Han, Yo-Sub
    Salomaa, Kai
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014), 2014, 8370 : 466 - 477
12345