Fast Convolutions and Their Applications in Approximate String Matching-Reference-Cited by-同舟云学术

Fast Convolutions and Their Applications in Approximate String Matching

Published:2009 Issue: Volume: Page:254-265
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Fredriksson Kimmo,Grabowski Szymon

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-10217-2_26.pdf

Reference21 articles.

1. Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. In: Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms, San Francisco, CA, pp. 794–803 (2000)

2. Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. J. Comput. System Sci. 47, 424–436 (1993)

3. Fischer, M.J., Paterson, M.: String matching and other products. In: Karp, R.M. (ed.) Proceedings of the SIAM-AMS Complexity of Computation, Providence, RI, pp. 113–125 (1974)

4. Lecture Notes in Computer Science;P. Clifford,2005

5. Lecture Notes in Computer Science;A. Amir,2005

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. BiSon-e: a lightweight and high-performance accelerator for narrow integer linear algebra computing on the edge;Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems;2022-02-22

2. On String Matching with Mismatches;Algorithms;2015-05-26

3. Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching;European Journal of Combinatorics;2013-01