International audienceGenome sequencing of numerous species raises the need of complete genome comparison with precise and fast similarity searches. Today, advanced seed-based techniques (spaced seeds, multiple seeds, subset seeds) provide better sensitivity/specificity ratios. We present an implementation of such a seed-based technique onto parallel specialized hardware embedding reconfigurable architecture (FPGA), where the FPGA is tightly connected to large capacity Flash memories. This parallel system allows large databases to be fully indexed and rapidly accessed. Compared to traditional approaches like the Blastp software, we obtain both significant speed-up and better results. As our knowledge, this is the first attempt to exploit mo...
International audienceThe seeding technique became central in the theory of sequence alignment and t...
International audienceSeed-based heuristics have proved to be efficient for studying similarity betw...
Molecular biologists frequently compare an unknown protein sequence with a set of other known sequen...
International audienceGenome sequencing of numerous species raises the need of complete genome compa...
Abstract—Sequence similarity search is a common and re-peated task in molecular biology. The rapid g...
International audienceSequence similarity search is a common and repeated task in molecular biology....
International audienceGenomic sequence comparison algorithms represent the basic toolbox for process...
International audienceThis paper presents a parallel architecture for computing genomic sequence ali...
This paper describes a parallel FPGA implementation of a genomic sequence comparison algorithm for f...
International audienceThis paper describes a parallel FPGA implementation of a genomic sequence comp...
We apply the concept of subset seeds to similarity search in protein sequences. The main question st...
This report presents the implementation of a protein sequence comparison algorithm specifically desi...
Summary: Multiple spaced seeds represent the current state-of-the-art for similarity search in bioin...
International audienceThe seeding technique became central in the theory of sequence alignment and t...
International audienceSeed-based heuristics have proved to be efficient for studying similarity betw...
Molecular biologists frequently compare an unknown protein sequence with a set of other known sequen...
International audienceGenome sequencing of numerous species raises the need of complete genome compa...
Abstract—Sequence similarity search is a common and re-peated task in molecular biology. The rapid g...
International audienceSequence similarity search is a common and repeated task in molecular biology....
International audienceGenomic sequence comparison algorithms represent the basic toolbox for process...
International audienceThis paper presents a parallel architecture for computing genomic sequence ali...
This paper describes a parallel FPGA implementation of a genomic sequence comparison algorithm for f...
International audienceThis paper describes a parallel FPGA implementation of a genomic sequence comp...
We apply the concept of subset seeds to similarity search in protein sequences. The main question st...
This report presents the implementation of a protein sequence comparison algorithm specifically desi...
Summary: Multiple spaced seeds represent the current state-of-the-art for similarity search in bioin...
International audienceThe seeding technique became central in the theory of sequence alignment and t...
International audienceSeed-based heuristics have proved to be efficient for studying similarity betw...
Molecular biologists frequently compare an unknown protein sequence with a set of other known sequen...