Title :

Subset seed automaton

Author(s) :

Kucherov, Gregory [Auteur]
Sequential Learning [SEQUOIA]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Noé, Laurent [Auteur correspondant]
Sequential Learning [SEQUOIA]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Roytberg, Mihkail [Auteur]
Institute of Mathematical Problems in Biology [IMPB RAS]

Conference title :

CIAA 2007

City :

Prague

Country :

République tchèque

Start date of the conference :

2007-07

Journal title :

Lecture Notes in Computer Science

Publication date :

2007

HAL domain(s) :

Informatique [cs]/Bio-informatique [q-bio.QM]
Sciences du Vivant [q-bio]/Bio-Informatique, Biologie Systémique [q-bio.QM]
Informatique [cs]/Algorithme et structure de données [cs.DS]
Informatique [cs]/Informatique et langage [cs.CL]

English abstract : [en]

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 ...
Show more >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.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

ANR Project :

Comparison of Complete Genomes: an algorithmic and statistical approach to investigate the mechanisms of bacterial genome evolution

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL