Fast algorithms for comparison of similar unordered trees

Authors:
Daiji Fukagawa;Tatsuya Akutsu
Affiliations:
Department of Intelligence Science and Technology, Graduate School of Informatics, Kyoto University, Kyoto, Japan;Bioinformatics Center, Institute for Chemical Research, Kyoto University, Kyoto, Japan
Venue:
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Year:
2004

Citing 14
Cited 1

Fast parallel and serial approximate string matching

Journal of Algorithms
Simple fast algorithms for the editing distance between trees and related problems

SIAM Journal on Computing
Fast algorithms for the unit cost editing distance between trees

Journal of Algorithms
On the editing distance between unordered labeled trees

Information Processing Letters
Some MAX SNP-hard results concerning unordered labeled trees

Information Processing Letters
Alignment of trees: an alternative to tree edit

Theoretical Computer Science
The Tree-to-Tree Correction Problem

Journal of the ACM (JACM)
On the approximation of largest common subtrees and largest common point sets

Theoretical Computer Science
Faster Subtree Isomorphism

Journal of Algorithms
The symmetry number problem for trees

Information Processing Letters
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Algorithms on Trees and Graphs

Algorithms on Trees and Graphs
Computing the Edit-Distance between Unrooted Ordered Trees

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A fast algorithm for optimal alignment between similar ordered trees

Fundamenta Informaticae - Special issue on computing patterns in strings

Approximating tree edit distance through string edit distance

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present fast algorithms for computing the largest common subtree (LCST) and the optimal alignment when two similar unordered trees are given We present an O(4Kn) time algorithm for the LCST problem for rooted trees, where n is the maximum size of two input trees and K is the minimum number of edit operations to obtain LCST We extend this algorithm to unrooted trees and obtain an O(K 4Kn) time algorithm We also show that the alignment problem for rooted and unordered trees of bounded degree can be solved in linear time if K is bounded by a constant.