7648 search results - page 1096 / 1530 » A Data Locality Optimizing Algorithm |
208
click to vote
BMCBI
2011
14 years 8 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
222
click to vote
SIGMOD
2007
ACM
16 years 5 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
162
click to vote
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
151
click to vote
RECOMB
2004
Springer
16 years 5 months ago
2004
Springer
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...
145
click to vote
IAT
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine...