2089 search results - page 134 / 418 » A New Problem in String Searching |
GCB
1997
Springer
15 years 2 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
SIGIR
2004
ACM
15 years 3 months ago
2004
ACM
Abstract. Peer-to-peer architectures are a potentially powerful model for developing large-scale networks of text-based digital libraries, but peer-to-peer networks have so far pro...
195
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
SETN
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
AI
2003
Springer
15 years 3 months ago
2003
Springer
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...