516 search results - page 17 / 104 » Sets of k-Independent Strings |
SPIRE
2004
Springer
14 years 26 days ago
2004
Springer
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We als...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
Constraint-based mining has been proven to be extremely useful for supporting actionable pattern discovery. However, useful conjunctions of constraints that support domain driven ...
CSB
2005
IEEE
14 years 1 months ago
2005
IEEE
Peptide compositions constructed out of whole sets of protein sequences can be used as species signatures for phylogenetic analysis. To account for point mutations, an amino acid ...
JQL
2006
13 years 7 months ago
2006
In a recent work, M. Covington discusses the enumeration of two different sets of alignments of two strings of symbols using elementary combinatorial techniques. He defines two fu...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...