122 search results - page 8 / 25 » The approximability of the String Barcoding problem |
187
click to vote
ICDE
2008
IEEE
15 years 10 months ago
2008
IEEE
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
IJFCS
2002
14 years 9 months ago
2002
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
125
click to vote
CPM
1998
Springer
15 years 1 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
GBRPR
2007
Springer
15 years 1 months ago
2007
Springer
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
SPIRE
1999
Springer
15 years 1 months ago
1999
Springer
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...