The SIMPROF is an a posteriori permutation test of the null hypothesis that the set of samples below a given node does not show any multivariate structure, which are then represented by dashed lines.
To facilitate visual comparison, nodes are scaled by 'summarized reads', that is, the number of reads assigned to or below a given node.
The inputs to a given node are the outputs of nodes in the layer below, multiplied by the weights of their connections.
Leverage centrality is a measure of the relationship between the degree of a given node (ki) and the degree of each of its neighbors (kj), averaged over all neighbors (Ni), and is defined as shown below.
Many nodes contain well below 1% of the injected activity, and with the 6-h half-life of 99mTc the activity in a given node can be low, particularly if the surgery is delayed after injection of the radiopharmaceutical.
The connections between nodes have "weights" associated with them, which determine how much a given node's output will contribute to the next node's computation.
For the two nodes below the root, the path 1/1 is given to Node 2 and 1/2 to Node 4. Nodes 10 and 11 are a level below Node 4 and gain their parent path 1/2 and a new count indicating their location within their parent path thus giving them the paths 1/2/1 and /1/2/2, and so on.
Most notably, it can be used to find the closest node to a given target node.
In the algorithm construct given below, the node consists of "common map" and "data map".
To mitigate the impact of combinatorial explosion, we use a heuristic that, given a node in the enumeration tree, determines, without traversing the subtree below the node, whether any of its leaf descendants contains a MXST.
