354 search results - page 30 / 71 » Approximate String Joins |
CPM
2000
Springer
14 years 1 days ago
2000
Springer
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
HOTOS
2007
IEEE
13 years 11 months ago
2007
IEEE
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
CIKM
2001
Springer
14 years 6 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...
ISAAC
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
MST
2006
13 years 7 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...