Space Efficient Algorithms for Ordered Tree Comparison

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.

• Type: Journal
• Year: 2008
• Where: ALGORITHMICA
• Authors: Lusheng Wang, Kaizhong Zhang
• Keywords: ALGORITHMICA 2008, Corresponding Time Complexity, Ordered Tree, Tree Edit Distance