We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
Numerous metrics have been developed that attempt to assess the reliability of phylogenetic trees. Several of these commonly used measures of tree and tree branch support are desc...
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
We consider the wavelet transform of a finite, rooted, node-ranked, p-way tree, focusing on the case of binary (p = 2) trees. We study a Haar wavelet transform on this tree. Wave...
A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phyl...
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
- One of the key design issues for IP routers is the IP Lookup mechanism. IP lookup is an important action in router that is to find the next hop of each incoming packet with a lon...
The phenomenal growth of group communications and QoS-aware applications over the Internet have accelerated the development of multicasting technologies. The Core-Based Tree (CBT) ...