Author:
Fredriksson Kimmo,Grabowski Szymon
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Communications of the ACM 35(10), 74–82 (1992)
2. Lecture Notes in Computer Science;D. Cantone,2005
3. Cantone, D., Cristofaro, S., Faro, S.: On tuning the (δ,α)-sequential-sampling algorithm for δ-approximate matching with α-bounded gaps in musical sequences. In: Proceedings of ISMIR 20005 (2005)
4. Crochemore, M., Iliopoulos, C., Makris, C., Rytter, W., Tsakalidis, A., Tsichlas, K.: Approximate string matching with gaps. Nordic Journal of Computing 9(1), 54–65 (2002)
5. 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)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献