Author:
Franek Frantisek,Jennings Christopher G.,Smyth William F.
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. Assoc. Comput. Mach. 20(10), 762–772 (1977)
2. Charras, C., Lecroq, T.: Exact String Matching Algorithms, Laboratoire d’Informatique, Université de Rouen (1997),
http://www-igm.univ-mlv.fr/~lecroq/string/index.html
3. Cole, R., Hariharan, R.: Tighter bounds on the exact complexity of string matching. In: Proc. 33rd IEEE Symp. Found. Comp. Sci., pp. 600–609 (1992)
4. Cole, R., Hariharan, R., Paterson, M.S., Zwick, U.: Tighter lower bounds on the exact complexity of string matching. SIAM J. Comput. 24(1), 30–45 (1995)
5. Colussi, L.: Correctness and efficiency of pattern matching algorithms. Information & Computation 95, 225–251 (1991)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Innovative Automation Algorithm in Micro-multinational Data-Entry Industry;Cyber Security and Computer Science;2020
2. Efficient Exact Pattern-Matching in Proteomic Sequences;Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living;2009
3. Fast Matching Method for DNA Sequences;Combinatorics, Algorithms, Probabilistic and Experimental Methodologies