78 search results - page 9 / 16 » On The Closest String and Substring Problems |
PODS
2000
ACM
13 years 12 months ago
2000
ACM
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
HICSS
2008
IEEE
14 years 2 months ago
2008
IEEE
A transposition is an operation that exchanges two adjacent substrings. When it is restricted so that one of the substrings is a prefix, it is called a prefix transposition. The p...
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 ...
INTERNET
2007
13 years 7 months ago
2007
The content-based publish/subscribe (pub/sub)paradigm for system design is becoming increasingly popular, offering unique benefits for a large number of data-intensive applicatio...
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 ...