Algorithmica

, Volume 15, Issue 3, pp 205–222

A constrained edit distance between unordered labeled trees

Authors

  • Kaizhong Zhang
    • Department of Computer ScienceUniversity of Western Ontario
Article

DOI: 10.1007/BF01975866

Cite this article as:
Zhang, K. Algorithmica (1996) 15: 205. doi:10.1007/BF01975866

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(|T1|×|T2|×(deg(T1)+deg(T2))× log2(deg(T1)+deg(T2))). Our previous result shows that computing the edit distance between unordered labeled trees is NP-complete.

Key words

Unordered treesConstrained edit distanceApproximate tree matching

Copyright information

© Springer-Verlag New York Inc. 1996