The maximum agreement subtree problem is any of several closely related problems in graph theory and computer science. In all of these problems one is...

other subtrees) is over a given threshold. It is a more general form of the maximum agreement subtree problem. Frequent subtree mining is the problem of...

possible set of subtrees is the slowest but most optimizing way of performing this search. An alternative, more wide-ranging search, subtree pruning and regrafting...

rat, firmly ties the whale to the mammals. To cope with this problem, agreement subtrees, reduced consensus, and double-decay analysis seek to identify...

graph-theoretic sense) of restricted subtrees. The size of an agreement forest is simply its number of components. Intuitively, an agreement forest of size k for two...

Farris. 1979 Nelson consensus, Nelson. MAST (maximum agreement subtree)((GAS) greatest agreement subtree), a consensus method, Gordon. Bootstrap, Bradley...

black height of the subtree rooted by it. In this article, the black height of a NIL node shall be set to 0, because its subtree is empty as suggested...

Sagot, Marie-France; Wakabayashi, Yoshiko (April 2007). "The maximum agreement forest problem: Approximation algorithms and computational experiments". Theoretical...

through T.) Given a partial play s, let T s {\displaystyle T_{s}} be the subtree of T consistent with s subject to max(y0,y1,...,ylen(s)-1)<len(s). The...

(ADT) that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes. type...

Dinitz Y, Ziv-Ukelson M (April 2013). "Unrooted unordered homeomorphic subtree alignment of RNA trees". Algorithms for Molecular Biology. 8 (1): 13. doi:10...

individual B-MAC addresses and for group addresses; Group multicast trees are subtrees of the default shortest path tree formed by (source, group) pairing. Depending...