A detailed overview of current research in kernel methods and their application to
computational biology. Modern machine learning techniques are proving to be extremely …

Finding, understanding and managing software clones-passages of duplicated source code-
is of large interest in research and practice. There is an abundance of techniques to detect …

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 introduce a new text-indexing data structure, the String B-Tree, that can be seen as a link
between some traditional external-memory and string-matching data structures. In a short …

This paper considers various flavors of the following online problem: preprocess a text or
collection of strings, so that given a query string p, all matches of p with the text can be …

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 …

Consider a rooted tree whose nodes can be in two states: marked or unmarked. The marked
ancestor problem is to maintain a data structure with the following operations: mark (v) …

Automata for Matching Patterns Page 1 Automata for Matching Patterns Maxime Crochemore
and Christophe Hancart 1. Pattern matching and automata This chapter describes several …

In the dynamic dictionary matching problem, a dictionary D contains a set of patterns that
can change over time by insertion and deletion of individual patterns. The user also presents …

In this paper, we study the fundamental problem of maintaining a dynamic collection of
strings under the following operations:• make_string–add a string of constant length,• concat …