Bit-parallel string matching under Hamming distance in worst case time-Reference-Cited by-同舟云学术

Bit-parallel string matching under Hamming distance in worst case time

Published:2008-02 Issue:5 Volume:105 Page:182-187
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Grabowski Szymon,Fredriksson Kimmo

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference8 articles.

1. 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

2. R.A. Baeza-Yates, Efficient text searching, PhD thesis, Department of Computer Science, University of Waterloo, Ontario, 1989

3. A new approach to text searching;Baeza-Yates;Comm. ACM,1992

4. Bit-parallel (δ,γ)-matching suffix automata;Crochemore;J. Discrete Algorithms (JDA),2005

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

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

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

2. Fast Identification of Heavy Hitters by Cached and Packed Group Testing;String Processing and Information Retrieval;2019

3. SOPanG: online text searching over a pan-genome;Bioinformatics;2018-06-22

4. New algorithms for fixed-length approximate string matching and approximate circular string matching under the Hamming distance;The Journal of Supercomputing;2017-11-20

5. On approximate pattern matching with thresholds;Information Processing Letters;2017-07