Dominant seeds have been introduced by Mak and Benson (2009) in order to reduce the number of candidate seeds and to allow parameter-free calculation of spaced seed sensitivity. We extend their work on the Bernoulli model by considering the Hit Integration, the Heaviside and the Dirac models, and the design of multiple seeds. From a theoretical standpoint, we show that a simple general framework can be set on these models by use of a counting semi-ring. From a practical standpoint, we experimentally confirm that dominant seeds reduce the set of seeds, either to explore for single seeds, otherwise to store for multiple seeds, and give i
We address the problem of measuring the sensitivity of seed-based similarity search algorithms. In c...
Abstract Background The most frequently used tools in bioinformatics are those searching for similar...
We consider the problem of lossless spaced seed design for approximate pattern matching. We show tha...
Dominant seeds have been introduced by Mak and Benson (2009) to reduce the number of candidate seeds...
International audienceBackground : Spaced seeds, also named gapped q-grams, gapped k-mers, spaced q-...
Spaced seeds are a fundamental tool for similarity search in biosequences. The best sensitivity/sele...
We propose a general approach to compute the seed sensitivity, that can be applied to different defi...
We propose a general approach to compute the seed sensitivity, that can be applied to different def...
We propose a general approach to compute the seed sensitivity, that can be applied to different defi...
International audienceWe propose a general approach to compute the seed sensitivity, that can be app...
Spaced seeds are used in approximate pattern matching algorithms to quickly discard regions where a ...
We address the problem of estimating the sensitivity of seed-based similarity search algorithms. In ...
We address the problem of estimating the sensitivity of seed-based similarity search algorithms. In ...
A wide class of approximate pattern matching algorithms are based on a filtration phase in which spa...
A widely used class of approximate pattern matching algorithms work in two stages, the first being a...
We address the problem of measuring the sensitivity of seed-based similarity search algorithms. In c...
Abstract Background The most frequently used tools in bioinformatics are those searching for similar...
We consider the problem of lossless spaced seed design for approximate pattern matching. We show tha...
Dominant seeds have been introduced by Mak and Benson (2009) to reduce the number of candidate seeds...
International audienceBackground : Spaced seeds, also named gapped q-grams, gapped k-mers, spaced q-...
Spaced seeds are a fundamental tool for similarity search in biosequences. The best sensitivity/sele...
We propose a general approach to compute the seed sensitivity, that can be applied to different defi...
We propose a general approach to compute the seed sensitivity, that can be applied to different def...
We propose a general approach to compute the seed sensitivity, that can be applied to different defi...
International audienceWe propose a general approach to compute the seed sensitivity, that can be app...
Spaced seeds are used in approximate pattern matching algorithms to quickly discard regions where a ...
We address the problem of estimating the sensitivity of seed-based similarity search algorithms. In ...
We address the problem of estimating the sensitivity of seed-based similarity search algorithms. In ...
A wide class of approximate pattern matching algorithms are based on a filtration phase in which spa...
A widely used class of approximate pattern matching algorithms work in two stages, the first being a...
We address the problem of measuring the sensitivity of seed-based similarity search algorithms. In c...
Abstract Background The most frequently used tools in bioinformatics are those searching for similar...
We consider the problem of lossless spaced seed design for approximate pattern matching. We show tha...