Author:
Fredriksson Kimmo,Grabowski Szymon
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Cantone, D., Cristofaro, S., Faro, S.: An efficient algorithm for δ -approximate matching with α -bounded gaps in musical sequences. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 428–439. Springer, Heidelberg (2005)
2. 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 2005 (2005)
3. Crochemore, M., Iliopoulos, C., Makris, C., Rytter, W., Tsakalidis, A., Tsichlas, K.: Approximate string matching with gaps. Nordic J. of Computing 9(1), 54–65 (2002)
4. Lecture Notes in Computer Science;K. Fredriksson,2006
5. Johnson, D.B.: A priority queue in which initialization and queue operations take O(loglogD) time. Mathematical Systems Theory 15, 295–309 (1982)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献