Sciweavers

237 search results - page 1 / 48
» Practical and Optimal String Matching
Sort
View
SPIRE
2005
Springer
13 years 10 months ago
Practical and Optimal String Matching
Kimmo Fredriksson, Szymon Grabowski
ICALP
2005
Springer
13 years 10 months ago
Optimal Spaced Seeds for Faster Approximate String Matching
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
Martin Farach-Colton, Gad M. Landau, Süleyman...
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
13 years 6 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha
FUIN
2006
98views more  FUIN 2006»
13 years 4 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
13 years 10 months ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...