Author:
Dulucq Serge,Tichit Laurent
Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. Enumeration of ordered trees;Dershowitz;Discrete Math.,1980
2. Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology;Gusfield,1997
3. T. Jiang, L. Wang, K. Zhang, Alignment of trees—an alternative to tree edit, in: CPM ’94, 1994, pp. 75–86.
4. P. Klein, Computing the edit-distance between unrooted ordered trees, in: Lecture Notes in Computer Science ESA ’98 (Venice), Springer, Berlin, 1998, pp. 91–102.
5. P. Kilpelinen, H. Mannila, The tree inclusion problem, in: Proc. Internat. Joint Conf. on the Theory and Practice of Software Development, 1991, pp. 202–214.
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献