28 search results - page 1 / 6 » Efficient string matching with wildcards and length constrai... |
KAIS
2006
13 years 4 months ago
2006
This paper defines a challenging problem of pattern matching between a pattern P and a text T, with wildcards and length constraints, and designs an efficient algorithm to return e...
IPL
2007
13 years 4 months ago
2007
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...
PVLDB
2010
12 years 11 months ago
2010
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has ...
DCC
2005
IEEE
14 years 4 months ago
2005
IEEE
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
TCS
2008
13 years 4 months ago
2008
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...