A parallel tree difference algorithm

被引：2
|
作者：
Skillicorn, DB
机构：
[1] Dept. of Comp. and Info. Science, Goodwin Hall, Queen's University
来源：
INFORMATION PROCESSING LETTERS | 1996年 / 60卷 / 05期
基金：
加拿大自然科学与工程研究理事会;
关键词：
tree difference; tree edit; tree contraction; structured text; universal hashing; accumulations;
D O I：
10.1016/S0020-0190(96)00171-8
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We describe a tree difference and edit sequence algorithm with expected sequential execution time O(nlogIogn) and expected parallel execution time O(logn), for trees of size n. The algorithm assumes unique labels and permits operations only on leaves and frontier subtrees. Despite this assumption, its application domain includes structured text and hypertext, and it is much faster than existing algorithms based on dynamic programming.
引用
收藏
页码：231 / 235
页数：5
相关论文
共 50 条
  • [1] Parallel algorithm for constructing a labeled tree
    Natl Taiwan Univ of Science and, Technology, Taipei, Taiwan
    IEEE Trans Parallel Distrib Syst, 12 (1236-1240):
  • [2] A Streaming Parallel Decision Tree Algorithm
    Ben-Haim, Yael
    Tom-Tov, Elad
    JOURNAL OF MACHINE LEARNING RESEARCH, 2010, 11 : 849 - 872
  • [3] A SIMPLE PARALLEL TREE CONTRACTION ALGORITHM
    ABRAHAMSON, K
    DADOUN, N
    KIRKPATRICK, DG
    PRZYTYCKA, T
    JOURNAL OF ALGORITHMS, 1989, 10 (02) : 287 - 302
  • [4] A parallel algorithm for constructing a labeled tree
    Wang, YL
    Chen, HC
    Liu, WK
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1997, 8 (12) : 1236 - 1240
  • [5] New parallel algorithm for rooting a tree
    Kim, Taenam
    Oh, Dukhwan
    Lim, Eunki
    Korean Journal of Computational & Applied Mathematics, 1998, 5 (02): : 385 - 390
  • [6] A streaming parallel decision tree algorithm
    Ben-Haim, Yael
    Tom-Tov, Elad
    Journal of Machine Learning Research, 2010, 11 : 849 - 872
  • [7] A new parallel algorithm for rooting a tree
    Department of Computer Engineering, Kumoh National University of Technology, Sinpyeongdong, Kumisi, Kyeongbook, Korea, Republic of
    J. Appl. Math. Comp., 2 (385-390):
  • [8] A new parallel algorithm for rooting a tree
    Taenam Kim
    Dukhwan Oh
    Eunki Lim
    Korean Journal of Computational & Applied Mathematics, 1998, 5 (2): : 385 - 390
  • [9] A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction
    Shun, Julian
    Blelloch, Guy E.
    ACM Transactions on Parallel Computing, 2014, 1 (01)
  • [10] The scalability analysis of a parallel tree search algorithm
    Kolpakov, Roman
    Posypkin, Mikhail
    OPTIMIZATION LETTERS, 2020, 14 (08) : 2211 - 2226
12345