354 search results - page 4 / 71 » Approximate String Joins |
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
PVLDB
2008
13 years 7 months ago
2008
There has been considerable interest in similarity join in the research community recently. Similarity join is a fundamental operation in many application areas, such as data inte...
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
SPIRE
2010
Springer
13 years 6 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
CPM
2009
Springer
14 years 2 months ago
2009
Springer
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...