Author:
Fredriksson Kimmo,Ukkonen Esko
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Alfred V. Aho and Margaret J. Corasick. Efficient string matching: an aid to bibliographic search. Communications of the ACM, 18(6):333–340, June 1975.
2. A. Amir, G. Benson, and M. Farach. Alphabet independent two dimensional matching. In N. Alon, editor, Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, pages 59–68, Victoria, B.C., Canada, May 1992. ACM Press.
3. Ricardo Baeza-Pates and Mireille Regnier. Fast two-dimensional pattern matching. Information Processing Letters, 45(1):51–57, January 1993.
4. Robert S. Boyer and J. Strother Moore. A fast string searching algorithm. Communications of the ACM, 20(10):762–772, October 1977.
5. T. M. Caelli and Z. Q. Liu. On the minimum number of templates required for shift, rotation and size invariant pattern recognition. Pattern Recognition, 21:205–216, 1988.
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献