995 search results - page 55 / 199 » String Pattern Discovery |
DIS
2000
Springer
14 years 3 hour ago
2000
Springer
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
JDA
2008
13 years 7 months ago
2008
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
ICDE
2007
IEEE
14 years 2 months ago
2007
IEEE
In this work, we propose a multi-relational concept discovery method for business intelligence applications. Multi-relational data mining finds interesting patterns that span ove...
ICWS
2009
IEEE
13 years 5 months ago
2009
IEEE
The Service registry, the yellow pages of ServiceOriented Architecture (SOA), plays a central role in SOAbased service systems. The service registry has to be scalable to manage l...
CPM
2004
Springer
14 years 1 months ago
2004
Springer
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...