Consider the query, 'retrieve all data for cancer cell line samples'.
To exemplify this type of recommendation, consider the query from the previous example.
We consider the query optimization problem for path expressions that "branch," or specify traversals through two or more related subgraphs; such expressions are common in nontrivial queries over XML data.
In the next few sections, our plan is to explain these components using the query "List all growth control genes in dogs that function similar to human genes (but are absent in fruit flies)." For simplicity, we first consider the query without the parenthesized part, and then consider the full query to see how more complex queries can be constructed.
Consider a query which takes a long time to complete.
Consider a query set S, and a ranked response list R={ R, R, R,…, R N } of protein protein pairs.
Consider a query for genes concerning GRAS transcription factors, suggesting that these genes are activated during nodulation [ 48, 49].
Consider query samples X Q ={ x q 1, x q 2, …, x qn } and unknown samples X U ={ x u 1, x u 2, …, x um }, where x qi, x uj,∈ℝ d.
Consider a cDNA (query) sequence aligning in the sense direction with the plus strand of a genomic (subject) sequence.
When the best hit of a given query was an OR gene from another species, we considered the query sequence as an OR gene.
To formally express that overlap between exploratory queries, consider a current query (Q_c) for which a diversified set (S_c) is to be computed, and a history of processed queries ( {mathbb {Q}}_H = {Q_1, Q_2,..., Q_{c-1}}).
