A survey on tree edit distance and related problems
A survey on tree edit distance and related problems
复制标题
DOI：
10.1016/j.tcs.2004.12.030
复制
发表时间：
2005-06-09
影响因子：
1.1
通讯作者：
Bille, P
中科院分区：
文献类型：
--
作者：
Bille, P
我们研究了基于删除、插入和重新标记节点的简单局部操作来比较标记树的问题。这些操作导致了树的编辑距离、对齐距离和包含问题。对于每个问题，我们回顾了可用的结果，并详细介绍了解决问题的一个或多个中心算法。(c) 2005 Elsevier B.V.版权所有
We survey the problem of comparing labeled trees based on simple local operations of deleting, inserting, and relabeling nodes. These operations lead to the tree edit distance, alignment distance, and inclusion problem. For each problem we review the results available and present, in detail, one or more of the central algorithms for solving the problem. (c) 2005 Elsevier B.V. All rights reserved.