Author:
Park Kunsoo,Kim Dong Kyue
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. A.V. Aho, Algorithms for finding patterns in strings, in van Leeuwen, ed., Handbook of Theoretical Computer Science, North Holland, 1992.
2. A.V. Aho, J.E. Hopcroft and J.D.Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 187–189.
3. A. Amir, G. Benson and M. Farach, An alphabet independent approach to two-dimensional pattern matching, SIAM J. Comput. 23, 2 (1994), 313–323.
4. A. Apostolico, C. Iliopoulos, G.M. Landau, B. Schieber and U. Vishkin, Parallel construction of a suffix tree with applications, Algorithmica 3, (1988), 347–365.
5. R.S. Boyer and J.S. Moore, A fast string searching algorithm, Comm. ACM 20 (1977), 762–772.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献