Author:
Aratsu Taku,Hirata Kouichi,Kuboyama Tetsuji
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Akutsu, T.: A relationship between edit distance for ordered trees and edit distance for Euler strings. Inform. Proc. Let. 100, 105–109 (2006)
2. Augsten, N., Böhlen, M., Gamper, J.: Approximate matching of hierarchical data using pq-grams. In: Proc. VLDB 2005, pp. 301–312 (2005)
3. Bille, P.: A survey on tree edit distance and related problems. Theoret. Comput. Sci. 337, 217–239 (2005)
4. Lecture Notes in Computer Science;E.D. Demaine,2007
5. Lecture Notes in Computer Science;K. Kailing,2004
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献