Decomposition algorithms for the tree edit distance problem

被引：18
|
作者：
Dulucq, Serge [1 ]
Touzet, Helene [2 ]
机构：
[1] Univ Bordeaux 1, LaBRI, UMR CNRS 5800, F-33405 Talence, France
[2] Univ Lille 1, LIFL, UMR CNRS 8022, F-59655 Villeneuve Dascq, France
来源：
JOURNAL OF DISCRETE ALGORITHMS | 2005年 / 3卷 / 2-4期
关键词：
Algorithm; Edit distance; Alignment; Tree; Computational biology;
D O I：
10.1016/j.jda.2004.08.018
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We study the behavior of dynamic programming methods for the tree edit distance problem, such as [P. Klein, Computing the edit-distance between unrooted ordered trees, in: Proceedings of 6th European Symposium on Algorithms, 1998, p. 91-102; K. Zhang, D. Shasha, SIAM J. Comput. 18 (6) (1989) 1245-1262]. We show that those two algorithms may be described as decomposition strategies. We introduce the general framework of cover strategies, and we provide an exact characterization of the complexity of cover strategies. This analysis allows us to define a new tree edit distance algorithm, that is optimal for cover strategies. (C) 2004 Elsevier B. V. All rights reserved.
引用
收藏
页码：448 / 471
页数：24
相关论文
共 50 条
  • [1] Analysis of tree edit distance algorithms
    Dulucq, S
    Touzet, H
    [J]. COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2003, 2676 : 83 - 95
  • [2] An Optimal Decomposition Algorithm for Tree Edit Distance
    Demaine, Erik D.
    Mozes, Shay
    Rossman, Benjamin
    Weimann, Oren
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2009, 6 (01)
  • [3] An optimal decomposition algorithm for tree edit distance
    Demaine, Erik D.
    Mozes, Shay
    Rossman, Benjamin
    Weimann, Oren
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 146 - +
  • [4] Faster algorithms for guided tree edit distance
    Tsur, Dekel
    [J]. INFORMATION PROCESSING LETTERS, 2008, 108 (04) : 251 - 254
  • [5] Tree Edit Distance Problems: Algorithms and Applications to Bioinformatics
    Akutsu, Tatsuya
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2010, E93D (02): : 208 - 218
  • [6] Approximating tree edit distance through string edit distance
    Akutsu, Tatsuya
    Fukagawa, Daiji
    Takasu, Atsuhiro
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2006, 4288 : 90 - +
  • [7] Approximating Tree Edit Distance through String Edit Distance
    Akutsu, Tatsuya
    Fukagawa, Daiji
    Takasu, Atsuhiro
    [J]. ALGORITHMICA, 2010, 57 (02) : 325 - 348
  • [8] Approximating Tree Edit Distance through String Edit Distance
    Tatsuya Akutsu
    Daiji Fukagawa
    Atsuhiro Takasu
    [J]. Algorithmica, 2010, 57 : 325 - 348
  • [9] Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
    Aratsu, Taku
    Hirata, Kouichi
    Kuboyama, Tetsuji
    [J]. 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
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (4-5) : 352 - 364
12345