154 search results - page 13 / 31 » Approximate String Matching: A Simpler Faster Algorithm |
117
click to vote
DEBU
2010
15 years 2 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...
119
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
122
click to vote
ICDE
2010
IEEE
16 years 1 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 ...
128
click to vote
ISMB
1998
15 years 3 months ago
1998
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
126
click to vote
SIGMOD
2011
ACM
14 years 4 months ago
2011
ACM
Over the last decade the cost of producing genomic sequences has dropped dramatically due to the current so called “next-gen” sequencing methods. However, these next-gen seque...