Skip to Main content Skip to Navigation
Conference papers

Subset seed automaton

Gregory Kucherov 1, 2 Laurent Noé 1, 2, * Mihkail Roytberg 3
* Corresponding author
2 SEQUOIA - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : 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.
Complete list of metadata
Contributor : Laurent Noé Connect in order to contact the contributor
Submitted on : Friday, September 7, 2007 - 4:38:24 PM
Last modification on : Friday, February 4, 2022 - 3:30:31 AM
Long-term archiving on: : Thursday, April 8, 2010 - 9:45:41 PM


Publisher files allowed on an open archive




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⟩



Record views


Files downloads