Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

WIA
2007
Springer

favoriteEmaildiscussreport

72views Artificial Intelligence» more WIA 2007»

Subset Seed Automaton

13 years 10 months ago

Subset Seed Automaton

Download hal.archives-ouvertes.fr

We study the pattern matching automaton introduced in [1] for the purpose of seed-based similarity search. We show that our deﬁnition 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 eﬃcient implementation of the automaton construction. We also present some experimental results and show that this automaton can be successfully applied to more general situations.

Gregory Kucherov, Laurent Noé, Mikhail A. R

Real-time Traffic

Artificial Intelligence | Automaton | Compact Automaton | Pattern Matching Automaton | WIA 2007 |

claim paper

Related Content

» A Unifying Framework for Seed Sensitivity and Its Application to Subset Seeds

» On building minimal automaton for subset matching queries

» Speeding up subset seed algorithm for intensive protein sequence comparison

» Protein Similarity Search with Subset Seeds on a Dedicated Reconfigurable Hardware

» Efficient Seeding Techniques for Protein Similarity Search

» On Reversible Automata

» Efficient Chaining of Seeds in Ordered Trees

» Automaton in or out runtime plan optimization for XML stream processing

» Feature Subset Selection using ICA for Classifying Emphysema in HRCT Images

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	WIA
Authors	Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg

Comments (0)