Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. A. V. Aho and M. J. Corasick. Efficient string matching: an aid to bibliographic search. Communications of the ACM, 18(6):333–340, 1975.
2. A. Amir, M. Farach, Z. Galil, R. Giancarlo, and K. Park. Dynamic dictionary matching. J. Comput. Syst. Sci., 49(2):208–222, 1994.
3. P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for heuristic determination of minimum path cost. IEEE Trans. on SSC, 4:100, 1968.
4. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262–272, 1976.
5. B. Meyer. Incremental string matching. Inf. Process. Lett., 21:219–227, 1985.