Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching-Reference-Cited by-同舟云学术

Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching

Published:2013-01 Issue:1 Volume:34 Page:38-51
ISSN:0195-6698
Container-title:European Journal of Combinatorics
language:en
Short-container-title:European Journal of Combinatorics

Author:

Fredriksson Kimmo,Grabowski Szymon

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics

Reference28 articles.

1. Generalized string matching;Abrahamson;SIAM J. Comput.,1987

2. The practical efficiency of convolutions in pattern matching algorithms;Amir;Fund. Inform.,2008

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

4. Approximate matching in the L1 metric;Amir,2005

5. A new approach to text searching;Baeza-Yates;Commun. ACM,1992

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

1. Faster Algorithms for Text-to-Pattern Hamming Distances;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Rank and select operations on a word;Information Processing Letters;2021-12

3. Speedup of discrete Fourier transform by efficient modular arithmetic;Concurrency and Computation: Practice and Experience;2021-09-15

4. Approximate String Matching with SIMD;The Computer Journal;2021-02-23

5. A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations;PLOS ONE;2017-10-10