Author:
Das Gautam,Fleischer Rudolf,Gasieniec Leszek,Gunopulos Dimitris,Kärkkäinen Juha
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. A. V. Aho, J. E. Hopcroft and J. D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
2. Z. Galil and K. Park: An improved algorithm for approximate string matching. SIAM J. Comp., 19(6) (Dec. 1990), 989–999.
3. G. M. Landau and U. Vishkin: Fast parallel and serial approximate string matching. J. Algorithms, 10(2) (June 1989), 157–169.
4. J. H. van Lint and R. M. Wilson: A Course in Combinatorics. Cambridge University Press, 1992.
5. H. Mannila and H. Toivonen: Discovering frequent episodes in sequences. Proc. 2nd International Conference on Knowledge Discovery and Data Mining (KDD'96), 146–151. AAAI Press 1996.
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献