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

572 A Fast String-Searching Algorithm – R S Boyer, J S Moore - 1977
107 A very fast substring search algorithm – Daniel M Sunday - 1990
46 Fast String Searching – Andrew Hume, Daniel Sunday - 1991
106 Practical fast searching in strings – R. Nigel Horspool - 1980
627 V.R.: Fast pattern matching in strings – D E Knuth, J H Morris, Pratt - 1977
224 A New Approach to Text Searching – Ricardo A. Baeza-yates, Blanco Encalada, Gaston H. Gonnet
10 On improving the average case of the Boyer-Moore string matching algorithm – R F ZHU, T TAKAOKA - 1987
6 Practical and optimal string matching – Grabowski - 2005
12 Alternative algorithms for bit-parallel string matching – Hannu Peltola, Jorma Tarhio - 2003
60 Fast and Flexible String Matching by Combining Bit-parallelism and Suffix Automata – Gonzalo Navarro, Mathieu Raffinot - 1998
34 Exact string matching algorithms – Christian Charras, Thierry Lecroq - 2004
3836 J.D.: Introduction to automata theory, languages, and computation – J E Hopcroft, R Motwani, Ullman
318 Fast text search allowing errors – Udi Manber, S Wu - 1992
10 Improved string searching – R A Baeza-Yates - 1989
116 A fast algorithm for multi-pattern searching – Sun Wu, Udi Manber - 1994
153 Approximate string matching with q-grams and maximal matches – E Ukkonen - 1992
327 Text Algorithms – M Crochemore, W Rytter - 1994
93 Flexible Pattern Matching in Strings – Practical on-line search algorithms for texts and biological sequences – G Navarro, M Raffinot - 2002
11 Fast variants of bit parallel approach to suffix automata – J Holub, B