78 search results - page 13 / 16 » On The Closest String and Substring Problems |
CCCG
2008
13 years 9 months ago
2008
Curve matching is an important computational task for domains such as: reconstruction of archaeological fragments, forensics investigation, measuring melodic similarity, and model...
SIGMOD
2008
ACM
14 years 7 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...
CPM
1998
Springer
13 years 11 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...
BALT
2006
13 years 11 months ago
2006
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...
SWAT
2004
Springer
14 years 27 days 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...