The phrase "as a root node" is correct and usable in written English.
It can be used in contexts related to data structures, particularly in computer science or programming, where it refers to the topmost node in a tree structure.
Example: "In this binary tree, the value '10' serves as a root node, connecting all other nodes beneath it."
Alternatives: "as a primary node" or "as a top node".
For the calculation of the CC-CLD, each leaf node of the main tree, which reflects the number of macromolecules with a given chain length, serves as a root node for a sub-tree containing information on the CC distribution for the macromolecules with the selected chain length.
For an Octree, an original data space is represented as a root node.
The load bus which locates at the beginning or the end of the tripped transmission line is specified as a root node.
Briefly, the intensities of the selected peaks were submitted to BPS as a "Root node".
In the telecommunications field a "central office" connecting to the backbone network is often predefined and may be considered as a root node active in any feasible solution.
If all the input trees share a common label (which can be viewed as a root node), both tree compatibility and agreement are solvable in polynomial time [ 2, 3].
As the path from a root node to a leaf node in a decision tree is interpreted as a regression rule, a random forests is equivalently represented as a collection of regression rules.
The set Δ(a) is the subtree that has a as its root node.
Each subnode can then be treated independently as a new root node for all subsequent splits, and the pattern continues until every subject constitutes a terminal node, resulting in a very large and complex tree.
We note that this approach may affect the comparison of Model A and B in BayesTraits as an incorrect root node may hamper the detection of trait evolution, hence we repeated our analyses assigning another arbitrary individual bearing the most common haplotype to the root node and checked for concordance of results.
These approaches consider a video sequence as the root node of a tree where the bottom nodes correspond to individual tracks.
