2393 search results - page 220 / 479 » Bounds-Consistent Local Search |
136
Voted
IPM
2007
15 years 3 months ago
2007
The performance of parallel query processing in a cluster of index servers is crucial for modern web search systems. In such a scenario, the response time basically depends on the...
155
Voted
BIBE
2008
IEEE
15 years 10 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
146
Voted
BMCBI
2006
15 years 3 months ago
2006
Background: The identification of statistically overrepresented sequences in the upstream regions of coregulated genes should theoretically permit the identification of potential ...
159
Voted
BMCBI
2005
15 years 3 months ago
2005
Background: High throughput microarray analyses result in many differentially expressed genes that are potentially responsible for the biological process of interest. In order to ...
131
Voted
PODS
2008
ACM
16 years 3 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...