Approximate tree matching in the presence of variable length don't cares (1994) [33 citations — 6 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@ARTICLE{Zhang94approximatetree,author = {Kaizhong Zhang and Dennis Shasha and Jason T. L. Wang},
title = {Approximate tree matching in the presence of variable length don't cares},
journal = {Journal of Algorithms},
year = {1994},
volume = {16},
pages = {33--66}
}
Years of Citing Articles
Abstract:
Ordered labeled trees are trees in which the sibling order matters. This paper presents algorithms for three problems having to do with approximate matching for such trees with variable-length don't cares (VLDC's). In strings, a VLDC symbol in the pattern may substitute for zero or more symbols in the data string. For example, if "comer " is the pattern, then the " " would substitute for the substring "put" when matching the data string "computer". Approximate VLDC matching in strings means that after the best possible substitution, the pattern still need not be the same as the data string for a match to be allowed. For example, "comer " matches "counter " within distance 1 (representing the cost of removing the "m " from "comer " and having the " " substitute for "unt"). We generalize approximate VLDC string matching to three algorithms for approximate VLDC matching on trees. The time complexity of our algorithms is O(jP j \Theta jDj \Theta min(depth(P); leaves(P)) \Theta min(depth(D); leaves(D))) (where jP j and jDj are the number of nodes respectively of the pattern P and the data tree D), the same as for the best approximate tree matching algorithm without VLDC's previously reported in [25].
