Author:
Giaquinta Emanuele,Grabowski Szymon,Fredriksson Kimmo
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference16 articles.
1. Faster string matching with super-alphabets;Fredriksson,2002
2. Fast searching in packed strings;Bille;J. Discrete Algorithms,2011
3. Constant-time word-size string matching;Breslauer,2012
4. Faster algorithms for string matching with k mismatches;Amir;J. Algorithms,2004
5. Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching;Fredriksson;Eur. J. Comb.,2013
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Lightweight Pattern Matching Method for DNA Sequencing in Internet of Medical Things;Computational Intelligence and Neuroscience;2022-09-08
2. An Approach to the Exact Packed String Matching Problem;Proceedings of the 4th International Conference on Natural Language Processing and Information Retrieval;2020-12-18
3. A note on the longest common substring with k-mismatches problem;Information Processing Letters;2015-06
4. Filtration Algorithms for Approximate Order-Preserving Matching;String Processing and Information Retrieval;2015
5. Circular Pattern Discovery;The Computer Journal;2014-03-02