Author:
Fredriksson Kimmo,Grabowski Szymon
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Grabowski, S., Fredriksson, K.: Bit-parallel string matching under Hamming distance in O(n⌈m/w ⌉) worst case time. IPL 105(5), 182–187 (2008)
2. Pǎtraşcu, M.: Predecessor search. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms. Springer, Heidelberg (2008)
3. Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Communications of the ACM 35(10), 74–82 (1992)
4. Navarro, G.: A guided tour to approximate string matching. ACM Computing Surveys 33(1), 31–88 (2001)
5. Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. J. Comput. System Sci. 47, 424–436 (1993)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献