122 search results - page 10 / 25 » Vector Algorithms for Approximate String Matching |
AIRS
2004
Springer
14 years 1 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
SSDBM
2003
IEEE
14 years 1 months ago
2003
IEEE
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
CIKM
2001
Springer
14 years 12 days ago
2001
Springer
Many document-based applications, including popular Web browsers, email viewers, and word processors, have a ‘Find on this Page’ feature that allows a user to find every occur...
DEBU
2010
13 years 8 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...
ICDE
2010
IEEE
14 years 7 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 ...