Author:
Fredriksson Kimmo,Grabowski Szymon
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Commun. ACM 35(10), 74–82 (1992)
2. Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. ACM 20(10), 762–772 (1977)
3. Crochemore, M., Iliopoulos, C., Navarro, G., Pinzon, Y., Salinger, A.: Bit-parallel (δ,γ)-matching suffix automata. Journal of Discrete Algorithms (JDA) 3(2–4), 198–214 (2005)
4. Crochemore, M., Rytter, W.: Text algorithms. Oxford University Press, Oxford (1994)
5. Lecture Notes in Computer Science;L. He,2004
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. 60 Years of Databases (part four);PROBLEMS IN PROGRAMMING;2022-06
2. Fast Cartesian Tree Matching;String Processing and Information Retrieval;2019
3. Parallel String Matching;Euro-Par 2016: Parallel Processing Workshops;2017
4. A Bloom filter based semi-index on q
-grams;Software: Practice and Experience;2016-08-24
5. A Very Fast String Matching Algorithm Based on Condensed Alphabets;Algorithmic Aspects in Information and Management;2016