Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. J. L. Gross and T. W. Tucker, Topological Graph Theory, Wiley, 1987.
2. M. Maes, “On a cyclic string-to-string correction problem,” Information Processing Letters 35 (1990), pp. 73–78.
3. B. A. Shapiro, “An algorithm for comparing multiple RNA secondary structures,” Computer Applications in the Biosciences (1988), pp. 387–393.
4. D. D. Sleator and R. E. Tarjan, “A data structure for dynamic trees,” Journal of Computer and System Sciences 26 (1983), pp. 362–391.
5. K.-C. Tai, “The tree-to-tree correction problem”, Journal of the Association for Computing Machinery 26 (1979), pp. 422–433.
Cited by
87 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Approximate Cartesian Tree Pattern Matching;Lecture Notes in Computer Science;2024
2. iASTMapper: An Iterative Similarity-Based Abstract Syntax Tree Mapping Algorithm;2023 38th IEEE/ACM International Conference on Automated Software Engineering (ASE);2023-09-11
3. Weighted Edit Distance Computation: Strings, Trees, and Dyck;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. Towards Extracting Reusable and Maintainable Code Snippets;Communications in Computer and Information Science;2023
5. SyncSignature;Proceedings of the VLDB Endowment;2022-10