We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
Similarity search in time series data is an active area of research in data mining. In this paper we introduce a new approach for performing similarity search over time series dat...
Background: Many programs have been developed to identify transcription factor binding sites. However, most of them are not able to infer two-word motifs with variable spacer leng...
Fabrice Touzain, Sophie Schbath, Isabelle Debled-R...