Publisher
Springer International Publishing
Reference35 articles.
1. Agnarsson, G., Greenlaw, R., Kantabutra, S.: On the graph relabeling problem. Thai J. Math. 8(1), 21–42 (2010)
2. Akutsu, T.: A linear time pattern matching algorithm between a string and a tree. In: Proceedings of 4th Symposium on Combinatorial Pattern Matching (CPM), pp. 1–10, Padova (1993)
3. Lecture Notes in Computer Science;A Amir,2007
4. Amir, A., Aumann, A., Lewenstein, M., Porat, E.: Function matching. SIAM J. Comput. 35(5), 1007–1022 (2006)
5. Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: rearrangement distances. In: Proceedings of 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1221–1229 (2006)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献