354 search results - page 30 / 71 » Approximate String Joins |
98
Voted
CPM
2000
Springer
15 years 4 months 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...
103
Voted
HOTOS
2007
IEEE
15 years 4 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 ...
102
click to vote
CIKM
2001
Springer
15 years 5 months 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...
101
Voted
ISAAC
2003
Springer
15 years 5 months 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...
105
Voted
MST
2006
15 years 11 days 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...