Exact algorithms for computing the tree edit distance between unordered trees

Tatsuya Akutsu,Daiji Fukagawa,Atsuhiro Takasu,Takeyuki Tamura

Theoretical Computer Science（2011）

引用 27|浏览0

暂无评分

摘要

This paper presents a fixed-parameter algorithm for the tree edit distance problem for unordered trees under the unit cost model that works in O(2.62^k@?poly(n)) time and O(n^2) space, where the parameter k is the maximum bound of the edit distance and n is the maximum size of input trees. This paper also presents polynomial-time algorithms for the case where the maximum degree of the largest common subtree is bounded by a constant.

查看译文

关键词

maximum degree,parameter k,input tree,unordered tree,Fixed-parameter algorithms,polynomial-time algorithm,largest common subtree,Tree edit distance,Dynamic programming,Unordered trees,unit cost model,fixed-parameter algorithm,maximum size,distance problem,exact algorithm

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要