122 search results - page 12 / 25 » The approximability of the String Barcoding problem |
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
ISCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
— A new technique that makes use of a systolic array structure is proposed for solving the common approximate substring (CAS) problem. This approach extends the technique introdu...
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
ICCSA
2010
Springer
14 years 2 months ago
2010
Springer
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
MCS
2008
Springer
13 years 7 months ago
2008
Springer
In many real-life applications of optimal control problems with constraints in form of partial differential equations (PDEs), hyperbolic equations are involved which typically desc...