Fast String Matching using an n-gram Algorithm (1994)

Cached

Download Links

by Jong Yong Kim , John Shawe-taylor
Venue:Software - Practice and Experience
Citations:10 - 0 self

Documents Related by Co-Citation

574 A fast string searching algorithm – R S Boyer, J S Moore - 1977
110 A very fast substring search algorithm – D M Sunday - 1990
48 Fast String Searching – Andrew Hume, Daniel Sunday - 1991
629 Fast pattern matching in strings – D E Knuth, J Morris, V R Pratt - 1977
107 Practical fast searching in strings – R. Nigel Horspool - 1980
10 Takaoka.“On improving the average case of the boyer-moore string matching algorithm – Rui Feng Zhu, T - 1987
3843 Introduction to Automata Theory, Languages, and Computation (2nd Edition – R M J E Hopcroft, J Ullman - 2000
317 Fast text searching allowing errors – S Wu, U Manber - 1992
10 Improved string searching – R A Baeza-Yates - 1989
116 A fast algorithm for multi-pattern searching – Sun Wu, Udi Manber - 1994
151 Approximate string-matching with Q-GRAMS and maximal matchs. Theoretical Computer Science 92(1 – E Ukkonen - 1992
229 A New Approach to Text Searching – Ricardo A. Baeza-yates, Blanco Encalada, Gaston H. Gonnet
8 Practical and optimal string matching – Grabowski - 2005
5 Fast matching method for DNA sequences – J W Kim, E Kim, K Park - 2007
61 Fast and Flexible String Matching by Combining Bit-parallelism and Suffix Automata – Gonzalo Navarro, Mathieu Raffinot - 1998
5 String matching in the dna alphabet – J Tarhio, H Peltola - 1997
7 A fast pattern matching algorithm – S SHEIK, S AGGARWAL, A PODDAR, N BALAKRISHNAN, K SEKAR - 2004
35 Exact string matching algorithms – Christian Charras, Thierry Lecroq - 2004
14 Alternative algorithms for bit-parallel string matching – Hannu Peltola, Jorma Tarhio - 2003