Abstract. We apply the concept of subset seeds proposed in [1] to similarity search in protein sequences. The main question studied is the design of efficient seed alphabets to con...
Mikhail A. Roytberg, Anna Gambin, Laurent No&eacut...
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
Many systems such as Tukwila and YFilter combine automaton and algebra techniques to process queries over tokenized XML streams. Typically in this architecture, an automaton is fi...
Feature subset selection, applied as a pre-processing step to machine learning, is valuable in dimensionality reduction, eliminating irrelevant data and improving classifier perfo...