Space efficient algorithms for ordered tree comparison

Authors:
Lusheng Wang;Kaizhong Zhang
Affiliations:
Department of Computer Science, City University of HongKong, HongKong;Dept. of Computer Science, University of Western Ontario, London, Ont., Canada
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 10
Cited 0

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

SIAM Journal on Computing
Alignment of trees: an alternative to tree edit

Theoretical Computer Science
The Tree-to-Tree Correction Problem

Journal of the ACM (JACM)
A linear space algorithm for computing maximal common subsequences

Communications of the ACM
Efficient Parallel Algorithms for Tree Editing Problems

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Computing Similarity between RNA Structures

CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Computing the Edit-Distance between Unrooted Ordered Trees

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A New Measure of the Distance between Ordered Trees and its Applications

A New Measure of the Distance between Ordered Trees and its Applications
A survey on tree edit distance and related problems

Theoretical Computer Science
Waveform Correlation by Tree Matching

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexity. We present new algorithms for computing the constrained ordered tree edit distance and the alignment of (ordered) trees. The techniques can also be applied to other related problems.