Sciweavers

254 search results - page 1 / 51
» Multiple Approximate String Matching
Sort
View
RSA
2002
73views more  RSA 2002»
13 years 10 months ago
New and faster filters for multiple approximate string matching
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
Ricardo A. Baeza-Yates, Gonzalo Navarro
CPM
2004
Springer
93views Combinatorics» more  CPM 2004»
14 years 4 months ago
Improved Single and Multiple Approximate String Matching
Kimmo Fredriksson, Gonzalo Navarro
WADS
1997
Springer
94views Algorithms» more  WADS 1997»
14 years 3 months ago
Multiple Approximate String Matching
Ricardo A. Baeza-Yates, Gonzalo Navarro
ICDE
2012
IEEE
252views Database» more  ICDE 2012»
12 years 1 months ago
Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
Chong Sun, Jeffrey F. Naughton, Siddharth Barman
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
14 years 2 months ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt