28 search results - page 4 / 6 » Efficient string matching with wildcards and length constrai... |
ALGORITHMICA
2010
13 years 7 months ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
JSAC
2006
13 years 7 months ago
2006
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packets....
SPIRE
2009
Springer
14 years 2 months ago
2009
Springer
Given a pattern p over an alphabet Σp and a text t over an alphabet Σt, we consider the problem of determining a mapping f from Σp to Σ+ t such that t = f(p1)f(p2) . . . f(pm)....
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...
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...