Subset seed automaton - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Subset seed automaton


We study the pattern matching automaton introduced in [KucherovNoeRoytbergJBCB06] 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 andpresent 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.
Fichier principal
Vignette du fichier
main.pdf (208.62 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

inria-00170414 , version 1 (07-09-2007)



Gregory Kucherov, Laurent Noé, Mihkail Roytberg. Subset seed automaton. CIAA 2007, Jul 2007, Prague, Czech Republic. pp.180-191, ⟨10.1007/978-3-540-76336-9_18⟩. ⟨inria-00170414⟩
165 View
120 Download



Gmail Facebook Twitter LinkedIn More