Sciweavers

16 search results - page 1 / 4
» Performing Local Similarity Searches with Variable Length Se...
Sort
View
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 1 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
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 ...
Abhijit Pol, Tamer Kahveci
RECOMB
2004
Springer
14 years 7 months ago
Designing multiple simultaneous seeds for DNA similarity search
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...
Yanni Sun, Jeremy Buhler
ADC
2005
Springer
122views Database» more  ADC 2005»
14 years 29 days ago
Finding Similarity in Time Series Data by Method of Time Weighted Moments
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...
Durga Toshniwal, Ramesh C. Joshi
BMCBI
2008
128views more  BMCBI 2008»
13 years 7 months ago
SIGffRid: A tool to search for sigma factor binding sites in bacterial genomes using comparative approach and biologically drive
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...