Selected papers that cite this one
- Weimin Chen. More efficient algorithm for ordered tree inclusion. Journal of Algorithms, 26(2):370-385, February 1998.
- Pekka Kilpeläinen and Heikki Mannila. Ordered and unordered tree inclusion. SIAM Journal on Computing, 24(2):340-356, April 1995.
- Fabrizio Luccio and Linda Pagli. Approximate matching for two families of trees. Information and Computation, 123(1):111-120, 15 November 1995.
- Kaizhong Zhang. A constrained edit distance between unordered labeled trees. Algorithmica, 15(3):205-222, March 1996.