Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference18 articles.
1. A new approach to text searching;Baeza-Yates;Commun. ACM,1992
2. Single and multiple consecutive permutation motif search;Belazzougui,2013
3. A fast string searching algorithm;Boyer;Commun. ACM,1977
4. D. Cantone, S. Faro, M.O. Külekci, An efficient skip-search approach to the order-preserving pattern matching problem, in: Holub and Zdárek [14], pp. 22–35.
5. C. Charras, T. Lecroq, J.D. Pehoushek, A very fast string matching algorithm for small alphabeths and long patterns (extended abstract), in: Combinatorial Pattern Matching, 9th Annual Symposium, CPM 98, Piscataway, New Jersey, USA, July 20-22, 1998, Proceedings, 1998, pp. 55–64. http://dx.doi.org/10.1007/BFb0030780.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献