Faster pattern matching with character classes using prime number encoding-Reference-Cited by-同舟云学术

Faster pattern matching with character classes using prime number encoding

Published:2009-05 Issue:3 Volume:75 Page:155-162
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Linhart Chaim,Shamir Ron

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference21 articles.

1. Fast pattern matching in strings;Knuth;SIAM J. Comput.,1977

2. A fast string searching algorithm;Boyer;Commun. ACM,1977

3. Algorithms on Strings, Trees, and Sequences;Gusfield,1997

4. M. Fischer, M. Paterson, String matching and other products, in: R.M. Karp (Ed.), Complexity of Computation, SIAM–AMS Proceedings, 1974, pp. 113–125

5. P. Indyk, Faster algorithms for string matching problems: matching the convolution bound, in: Proc. 39th IEEE Annual Symposium on Foundations of Computer Science, 1998, pp. 166–173

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

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

2. Fast Convolutions of Packed Strings and Pattern Matching with Wildcards;International Journal of Foundations of Computer Science;2017-04

3. Multi-pattern matching algorithm with wildcards based on bit-parallelism;Wuhan University Journal of Natural Sciences;2017-03-11

4. Multi-pattern Matching Algorithm with Wildcards Based on Euclidean Distance and Hash Function;Computational Science and Its Applications – ICCSA 2016;2016

5. Modulated string searching;Theoretical Computer Science;2014-03