… of k-mer based string kernels related to the recently presented mismatch kernel and designed
for use … These new kernels – restricted gappy kernels, substitution kernels, and wildcard …

… for string comparison with mismatches under the string kernels framework. … match constraints
our algorithms are several orders of magnitude faster than the existing algorithms for string …

… We review several families of string kernels designed in particular for use … kernels, and
three newer related models: restricted gappy kernels, substitution kernels, and wildcard kernels. …

… We introduce several new families of string kernels designed in particular for use with support
… These kernels – restricted gappy kernels, substitution kernels, and wildcard kernels – are …

… For inexact matches, unfortunately, such modifications are (still) not possible and we
suggest the online construction of Leslie et al. (2003b) for an efficient implementation. …

… inexact string matching kernels, and conflate the ideas of wildcards and gaps. Second, we
map inexact string matching … on the methods of efficient inexact string matching (Section 2) …

… of tasks in graph matching, viz. exact matching and inexact matching. In the former case, for
a … A number of graph kernels have been designed for graph matching [26, 57]. A seminal …

… Previous string kernels relied on defining an inexact-matching neigborhood of k-mers around
each k-length contiguous subsequence in the input sequence. For example, for the (k, m)-…

… inexact matching equivalents of R’s native exact matching functions … match of a string in
a lookup table. Here, we focus on dictionary lookup applications using online string matching …

… Here, we present our string-matching kernel for use in the … tree for finding exact matches
for a set of query strings. We … analysis performed, including inexact matching with a seed and …