rooted ordered tree

rooted ordered tree

[′rüd·əd ′ȯr·dərd ′trē]
(mathematics)
A rooted tree in which the order of the subtrees formed by deleting the root vertex is significant.
References in periodicals archive ?
The TreeMiner algorithm follows the combined depth-first/breadth-first traversal idea to discover all frequent embedded subtrees from a database of rooted ordered trees. Other than the general downward closure property (i.e., all subtrees of a frequent tree are frequent), TreeMiner takes advantage of a useful property of the string encodings for rooted ordered trees: removing either one of the last two vertices at the end of the string encoding of a rooted ordered tree P (with correspondent adjustment to the number of backtrack symbols) will result in the string encoding of a valid embedded subtree of P.
Let F be a forest of rooted ordered trees. We define a flow on F by attaching an input i [greater than or equal to] -1 on each node of F such that the outgoing rate of each node is greater than or equal to 0.