in ri a - 00 17 04 14 , v er si on 1 - 7 S ep 2 00 7 Subset seed automaton
نویسندگان
چکیده
We study the pattern matching automaton introduced in [1] for the purpose of seed-based similarity search. We show that our definition provides a compact automaton, much smaller than the one obtained by applying the Aho-Corasick construction. We study properties of this automaton and present an efficient implementation of the automaton construction. We also present some experimental results and show that this automaton can be successfully applied to more general situations.
منابع مشابه
in ri a - 00 00 11 64 , v er si on 1 - 2 4 M ar 2 00 6 A unifying framework for seed sensitivity and its application to subset seeds ( Extended abstract )
We propose a general approach to compute the seed sensitivity, that can be applied to different definitions of seeds. It treats separately three components of the seed sensitivity problem – a set of target alignments, an associated probability distribution, and a seed model – that are specified by distinct finite automata. The approach is then applied to a new concept of subset seeds for which ...
متن کاملha l - 00 13 58 11 , v er si on 1 - 8 M ar 2 00 7 Sofic trace subshift of a cellular automaton ⋆
The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. In this paper we study conditions for a sofic subshift to be the trace of a cellular automaton.
متن کاملcc sd - 0 00 00 57 7 ( v er si on 4 ) : 1 6 Ja n 20 04 Three - dimensional bubble clusters : shape , packing and growth - rate
We consider three-dimensional clusters of equal-volume bubbles packed around a central bubble and calculate their energy and optimal shape. We obtain the surface area and bubble pressures to improve on existing growth laws for three-dimensional bubble clusters. We discuss the possible number of bubbles that can be packed around a central one: the " kissing problem " , here adapted to deformable...
متن کاملModel Selection for Simplicial Approximation
In the computational geometry field, simplicial complexes have been used to describe an underlying geometric shape knowing a point cloud sampled on it. In this article, an adequate statistical framework is first proposed for the choice of a simplicial complex among a parametrized family. A least squares penalized criterion is introduced to choose a complex, and a model selection theorem states ...
متن کامل