A unifying framework for seed sensitivity and its application to subset seeds

Gregory Kucherov 1 Laurent Noé 1 Mikhail Roytberg
1 ADAGE - Applying discrete algorithms to genomics
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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 we propose an efficient automaton construction. Experimental results confirm that sensitive subset seeds can be efficiently designed using our approach, and can then be used in similarity search producing better results than ordinary spaced seeds.
Document type :
Reports
[Research Report] RR-5374, INRIA. 2004, pp.21
Liste complète des métadonnées

https://hal.inria.fr/inria-00070629
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 9:03:08 PM
Last modification on : Tuesday, October 25, 2016 - 5:00:22 PM
Document(s) archivé(s) le : Sunday, April 4, 2010 - 9:36:29 PM

Identifiers

  • HAL Id : inria-00070629, version 1

Collections

Citation

Gregory Kucherov, Laurent Noé, Mikhail Roytberg. A unifying framework for seed sensitivity and its application to subset seeds. [Research Report] RR-5374, INRIA. 2004, pp.21. <inria-00070629>

Share

Metrics

Record views

244

Document downloads

82