Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Aho, A.V., Corasick, M.J.: Efficient string matching: An aid to bibliographic search. ACM Commun. 18(6), 333–340 (1975)
2. Arlazarov, V.L., Dinic, E.A., Kronrod, M.A., Faradzev, I.A.: On economical construction of the transitive closure of a directed graph. Soviet Mathematics Doklady 11(5), 1209–1210 (1970)
3. Lecture Notes in Computer Science;D. Belazzougui,2010
4. Lecture Notes in Computer Science;P. Bille,2009
5. Boyer, R.S., Moore, J.S.: A fast string searching algorithm. ACM Commun. 20(10), 762–772 (1977)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Streaming Dictionary Matching with Mismatches;Algorithmica;2021-10-17
2. Fast and flexible packed string matching;Journal of Discrete Algorithms;2014-09
3. Towards optimal packed string matching;Theoretical Computer Science;2014-03
4. A Two-Hashing Table Multiple String Pattern Matching Algorithm;2013 10th International Conference on Information Technology: New Generations;2013-04
5. Average Optimal String Matching in Packed Strings;Lecture Notes in Computer Science;2013