International Workshop on Algorithms in Bioinformatics

WABI 2005: Algorithms in Bioinformatics pp 251-263

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

  • Gregory Kucherov
  • Laurent Noé
  • Mikhail Roytberg
Conference paper

DOI: 10.1007/11557067_21

Volume 3692 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Kucherov G., Noé L., Roytberg M. (2005) A Unifying Framework for Seed Sensitivity and Its Application to Subset Seeds. In: Casadio R., Myers G. (eds) Algorithms in Bioinformatics. WABI 2005. Lecture Notes in Computer Science, vol 3692. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Gregory Kucherov
    • 1
  • Laurent Noé
    • 1
  • Mikhail Roytberg
    • 2
  1. 1.INRIA/LORIAVillers-lès-NancyFrance
  2. 2.Institute of Mathematical Problems in BiologyPushchino, Moscow RegionRussia