74 search results - page 8 / 15 » Improved Approximate String Matching Using Compressed Suffix... |
181
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
CSB
2005
IEEE
15 years 3 months ago
2005
IEEE
Microarray experiments are characterized by a massive amount of data, usually in the form of an image. Based on the nature of microarray images, we consider the microarray in term...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
Today's record matching infrastructure does not allow a flexible way to account for synonyms such as "Robert" and "Bob" which refer to the same name, and ...
VLDB
1993
ACM
15 years 1 months ago
1993
ACM
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
ALMOB
2006
14 years 9 months ago
2006
Background: Motif patterns of maximal saturation emerged originally in contexts of pattern discovery in biomolecular sequences and have recently proven a valuable notion also in t...