L-Trees and L-Transformation: A New Algorithm for Tree Matching Problem

Yangjun Chen and Yibin Chen (Canada)


Tree matching, Tree transformation, Trie


In a tree matching problem, we are given a pattern tree S of m nodes and a target tree T of n nodes, and required to point out all those nodes in T, at which S matches. In this paper, we propose a new algorithm for a subclass of tree matching problem. It needs only O(n + m) time.

Important Links:

Go Back