The dash line indicates an inferred path from an input sequence or a query node to a known pathway.
In the weighted ancestor problem one preprocesses a weighted tree to support fast predecessor queries on the path from a query node to the root.
First, the MIF from the query node to the additional sink is calculated as follows.
For the heterogeneous network, where,, representing the nodes, edge and nonnegative capacity on each edge respectively, the MIF from the query node to the sink through all the proteins of the complex is calculated by two steps.
These identified modules were then used as query modules (Figure 1c, A1; Figure 1e, A1) to search for cooperative modules to form a directed network where all edges ran from the Query nodes to the Cooperative nodes; (2) Identification of cooperative modules and creation of Disease-specific inter-module cooperation network.
In the WSS scheme, nodes that can move faster are selected to cache the queries while in the LNS scheme, nodes that are within L-hops of a querying node will cache the queries.
From this, all the nodes in the reference prefix trie that match the query node with a positive score are found.
In [31], the random walk is used to measure the density of each node from query nodes, and the problem is to find a community which maximizes the query-based density.
A regulatory path from the root node to the leaf node can be interpreted as a series of binary queries on the expression level (up-regulated or not OR down-regulated or not) of internal nodes (i.e., TFs) under treatment conditions leading to the observed expression levels of the genes in the leaf node under the same treatment conditions.
Whenever a branch reaches the last level, results to the original query are gathered from all the different branches that reach from the root node to one leaf.
