, Volume 15, Issue 3, pp 205-222

A constrained edit distance between unordered labeled trees

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

This paper considers the problem of computing a constrained edit distance between unordered labeled trees. The problem of approximate unordered tree matching is also considered. We present dynamic programming algorithms solving these problems in sequential timeO(|T 1|×|T 2|×(deg(T 1)+deg(T 2))× log2(deg(T 1)+deg(T 2))). Our previous result shows that computing the edit distance between unordered labeled trees is NP-complete.

This research was supported by the Natural Sciences and Engineering Research Council of Canada under Grant No. OGP0046373.
Communicated by H. N. Gabow.