662 search results - page 11 / 133 » Approximate Queries and Representations for Large Data Seque... |
BMCBI
2006
13 years 8 months ago
2006
Background: High throughput technologies often require the retrieval of large data sets of sequences. Retrieval of EMBL or GenBank entries using keywords is easy using tools such ...
GCB
1997
Springer
14 years 1 days 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....
EDBT
2002
ACM
14 years 8 months ago
2002
ACM
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
BMVC
1998
13 years 9 months ago
1998
A method of extracting, classifying and modelling non-rigid shapes from an image sequence is presented. Shapes are approximated by polygons where the number of sides is related to...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
The ongoing revolution in life sciences research is producing vast amounts of genetic and proteomic sequence data. Scientists want to pose increasingly complex queries on this dat...