A new tree inclusion algorithm

  title={A new tree inclusion algorithm},
  author={Yangjun Chen and Yibin Chen},
  journal={Inf. Process. Lett.},
We consider the following tree-matching problem: Given labeled, ordered trees P and T , can P be obtained from T by deleting nodes? Deleting a node v entails removing all edges incident to v and, if v has a parent u, replacing the edges from u to v by edges from u to the children of v. The existing algorithm for this problem needs O(|T || leaves(P )|) time and O(| leaves(P )|min{DT , | leaves(T )|}) space, where leaves(P ) (leaves(T )) stands for the number of the leaves of P(T ), and DT for… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 20 references

On Query Languages for the p-string data model

  • H. Mannila, K.-J. Raiha
  • in: H. Kangassalo, S. Ohsuga, H. Jaakola (Eds…
  • 2006
1 Excerpt

A new algorithm for the ordered tree inclusion problem

  • T. Richter
  • in: Proc. 8th Annual Symp. on Combinatorial…
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…