Author:
Akutsu Tatsuya,Fukagawa Daiji,Takasu Atsuhiro
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Akutsu, T.: A relation between edit distance for ordered trees and edit distance for Euler strings. Information Processing Letters 100, 105–109 (2006)
2. Batu, T., Ergun, F., Sahinalp, C.: Oblivious string embeddings and edit distance approximations. In: Proc. 17th ACM-SIAM Symp. Discrete Algorithms, pp. 792–801 (2006)
3. Bille, P.: A survey on tree edit distance and related problem. Theoretical Computer Science 337, 217–239 (2005)
4. Chen, W.: New algorithm for ordered tree-to-tree correction problem. Journal of Algorithms 40, 135–158 (2001)
5. Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. In: Proc. 13th ACM-SIAM Symp. Discrete Algorithms, pp. 667–676 (2002)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献