This algorithm can be extended in various ways to provide linear time prediction cost in the
length of the sequence to be classified. We demonstrate extensions in the case of position …

We describe several families of k-mer based string kernels related to the recently presented
mismatch kernel and designed for use with support vector machines (SVMs) for …

A key approach in string processing algorithmics has been the labeling paradigm which is
based on assigning labels to some of the substrings of a given string. If these labels are …

A classic open problem on tree pattern matching is whether the naive O (mn)-step algorithm
for finding all the occurrences of a pattern tree of size m in a text tree of size n can be …

In this paper we give a randomized O (nlogn)-time algorithm for the string matching with
don't cares problem. This improves the Fischer-Paterson bound from 1974 and answers the …

A common way of expressing string similarity in structural pattern recognition is the edit
distance. It allows one to apply the k NN rule in order to classify a set of strings. However …

Many applications need to solve the following problem of approximate string matching: from
a collection of strings, how to find those similar to a given string, or the strings in another …

String searching is a subject of both theoretical and practical interest in computer science.
This book presents a bibliographic overview of the field and an anthology of detailed …

Comparing text strings in terms of distance functions is a common and fundamental task in
many statistical text-processing applications. Thus far, string distance functionality has been …

We present a new algorithm for on-line approximate string matching. The algorithm is based
on the simulation of a non-deterministic finite automaton built from the pattern and using the …