178 search results - page 13 / 36 » Fast Algorithms for Top-k Approximate String Matching |
149
click to vote
DEBU
2010
15 years 4 months ago
2010
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
131
click to vote
MJ
2006
15 years 4 months ago
2006
This paper demonstrates a keyword match processor capable of performing fast dictionary search with approximate match capability. Using a content addressable memory with processor...
153
click to vote
CPM
2005
Springer
15 years 10 months ago
2005
Springer
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...
133
click to vote
CSB
2003
IEEE
15 years 10 months ago
2003
IEEE
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
153
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...