Sciweavers

102 search results - page 1 / 21
» Fast exact string matching algorithms
Sort
View
JCB
2008
122views more  JCB 2008»
13 years 4 months ago
Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...
Enno Ohlebusch, Stefan Kurtz
CF
2008
ACM
13 years 6 months ago
Exact multi-pattern string matching on the cell/b.e. processor
String searching is the computationally intensive kernel of many security and network applications like search engines, intrusion detection systems, virus scanners and spam filter...
Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Pe...
CPM
2005
Springer
123views Combinatorics» more  CPM 2005»
13 years 10 months ago
A Simple Fast Hybrid Pattern-Matching Algorithm
Abstract. The Knuth-Morris-Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the...
Frantisek Franek, Christopher G. Jennings, William...
CPM
2000
Springer
145views Combinatorics» more  CPM 2000»
13 years 9 months ago
Boyer-Moore String Matching over Ziv-Lempel Compressed Text
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect...
Gonzalo Navarro, Jorma Tarhio