Dominant seeds have been introduced by Mak and Benson (2009) to reduce the number of candidate seeds and to provide a parameter-free calculation of the spaced seed sensitivity on the Bernoulli model. We extend their work by considering the Hit Integration model of Chung and Park (2010) and new discrete Heaviside / Dirac models, with several applications on lossless seeds and multiple seeds. From a theoretical standpoint, we show that a generic framework can be set on all the proposed models, by applying a counting semi-ring to quickly compute large polynomial coefficients. From a practical standpoint, we experimentally confirm that dominant seeds reduce the set of, either single seeds to thoroughly analyse, otherwise multiple seeds to store...
We address the problem of measuring the sensitivity of seed-based similarity search algorithms. In c...
A wide class of approximate pattern matching algorithms are based on a filtration phase in which spa...
Spaced seeds are used in approximate pattern matching algorithms to quickly discard regions where a ...
Dominant seeds have been introduced by Mak and Benson (2009) in order to reduce the number of candid...
International audienceBackground : Spaced seeds, also named gapped q-grams, gapped k-mers, spaced q-...
Motivation: Standard search techniques for DNA repeats start by identifying small matching words, or...
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...
International audienceWe propose a general approach to compute the seed sensitivity, that can be app...
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 address the problem of estimating the sensitivity of seed-based similarity search algorithms. In ...
AbstractThe novel introduction of spaced seed idea in the filtration stage of sequence comparison by...
Abstract Background The most frequently used tools in bioinformatics are those searching for similar...
We address the problem of estimating the sensitivity of seed-based similarity search algorithms. In ...
We address the problem of measuring the sensitivity of seed-based similarity search algorithms. In c...
A wide class of approximate pattern matching algorithms are based on a filtration phase in which spa...
Spaced seeds are used in approximate pattern matching algorithms to quickly discard regions where a ...
Dominant seeds have been introduced by Mak and Benson (2009) in order to reduce the number of candid...
International audienceBackground : Spaced seeds, also named gapped q-grams, gapped k-mers, spaced q-...
Motivation: Standard search techniques for DNA repeats start by identifying small matching words, or...
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...
International audienceWe propose a general approach to compute the seed sensitivity, that can be app...
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 address the problem of estimating the sensitivity of seed-based similarity search algorithms. In ...
AbstractThe novel introduction of spaced seed idea in the filtration stage of sequence comparison by...
Abstract Background The most frequently used tools in bioinformatics are those searching for similar...
We address the problem of estimating the sensitivity of seed-based similarity search algorithms. In ...
We address the problem of measuring the sensitivity of seed-based similarity search algorithms. In c...
A wide class of approximate pattern matching algorithms are based on a filtration phase in which spa...
Spaced seeds are used in approximate pattern matching algorithms to quickly discard regions where a ...