Funder
University of Catania
Istituto Nazionale di Alta Matematica "Francesco Severi"
Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. Efficient string matching based on a two-step simulation of the suffix automaton;Faro,2021
2. A weak approach to suffix automata simulation for exact and approximate string matching;Faro;Theor. Comput. Sci.,2022
3. Introduction to Algorithms;Cormen,2009
4. The exact online string matching problem: a review of the most recent results;Faro;ACM Comput. Surv.,2013
5. Fast pattern matching in strings;Knuth;SIAM J. Comput.,1977
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Searching long patterns with BNDM;Software: Practice and Experience;2024-04-04