The reliability of a phylogenetic tree obtained from empirical data is usually measured by the bootstrap probability (Pb) of interior branches of the tree. If the bootstrap probability is high for most branches, the tree is considered to be reliable. If some interior branches show relatively low bootstrap probabilities, we are not sure that the inferred tree is really reliable. Here, we propose...

We give a 5-approximation algorithm to the rooted Subtree-Prune-and-Regraft (rSPR) distance between two phylogenies, which was recently shown to be NP-complete. This paper presents the first approximation result for this important tree distance. The algorithm follows a standard format for tree distances. The novel ideas are in the analysis. In the analysis, the cost of the algorithm uses a "cas...

Broadcast Encryption allows a centre to send information over a broadcast channel to a dynamically changing group of users. The performance is rated by the bandwidth required for the broadcast and the amount of secret information needed to be stored at the user end. It can also be rated by the computational overhead. In the “Stateless Receiver” model, receivers are incapable of storing any new ...

A phylogenetic tree is a rooted tree with unbounded degree such that each leaf node is uniquely labelled from 1 to n. The descendent subtree of of a phylogenetic tree T is the subtree composed by all edges and nodes of T descending from a vertex. Given a set of phylogenetic trees, we present linear time algorithms for finding all leaf-agree descendent subtrees as well as all isomorphic descende...

background: two main muscles studied in the hand for evaluation of median nerve injuries are opponens pollicis (op) and abductor pollicis brevis (apb). however, riché-cannieu communicating branch (rccb) may limit the use of these muscles in electrodiagnosis. this condition is confusing in the case of median nerve injuries. this study was conducted to evaluate the prevalence of rccb.   methods: ...

A number of methods for solving multistage stochastic linear programs with recourse decompose the deterministic equivalent [4] to form subproblems based on scenarios (e.g., Rockafellar and Wets [6] and Mulvey and Ruszczyński [5]). Other methods use forms of Benders decomposition to form subproblems based on nodes of the scenario tree (e.g., Birge [1] and Gassmann [2]). Both types of algorithms ...

In this article, we present a statistical approach to machine translation that is based on Data-Oriented Parsing: Data-Oriented Translation (DOT). In DOT, we use linked subtree pairs for creating a derivation of a source sentence. Each linked subtree pair has a certain probability, and consists of two trees: one in the source language and one in the target language. When a derivation has been f...