138 research outputs found
Determining phylogenetic networks from inter-taxa distances
We consider the problem of determining the topological structure of a phylogenetic network given only information about the path-length distances between taxa. In particular, one of the main results of the paper shows that binary tree-child networks are essentially determined by such information
On the computational complexity of the rooted subtree prune and regraft distance
The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a tool for understanding and modelling reticulation events in evolutionary biology. In this paper, we show that computing the rooted subtree prune and regraft distance between two rooted binary phylogenetic trees on the same label set is NP-hard. This resolves a longstanding open problem. Furthermore, we show that this distance is xed parameter tractable when parameterised by the distance between the two trees
Approximating the partition function of the ferromagnetic Potts model
We provide evidence that it is computationally difficult to approximate the
partition function of the ferromagnetic q-state Potts model when q>2.
Specifically we show that the partition function is hard for the complexity
class #RHPi_1 under approximation-preserving reducibility. Thus, it is as hard
to approximate the partition function as it is to find approximate solutions to
a wide range of counting problems, including that of determining the number of
independent sets in a bipartite graph. Our proof exploits the first order phase
transition of the "random cluster" model, which is a probability distribution
on graphs that is closely related to the q-state Potts model.Comment: Minor correction
Consistency of Topological Moves Based on the Balanced Minimum Evolution Principle of Phylogenetic Inference
Many phylogenetic algorithms search the space of possible trees using topological rearrangements and some optimality criterion. FastME is such an approach that uses the balanced minimum evolution (BME) principle, which computer studies have demonstrated to have high accuracy. FastME includes two variants: balanced subtree prune and regraft (BSPR) and balanced nearest neighbor interchange (BNNI). These algorithms take as input a distance matrix and a putative phylogenetic tree. The tree is modified using SPR or NNI operations, respectively, to reduce the BME length relative to the distance matrix, until a tree with (locally) shortest BME length is found. Following computer simulations, it has been conjectured that BSPR and BNNI are consistent, i.e. for an input distance that is a tree-metric, they converge to the corresponding tree. We prove that the BSPR algorithm is consistent. Moreover, even if the input contains small errors relative to a tree-metric, we show that the BSPR algorithm still returns the corresponding tree. Whether BNNI is consistent remains open
Region Based Anomaly Detection With Real-Time Training and Analysis
We present a method of anomaly detection that is capable of real-time operation on a live stream of images. The real-time performance applies to the training of the algorithm as well as subsequent analysis, and is achieved by substituting the region proposal mechanism used in [9] with one that makes the overall method more efficient. where they generate thousands of regions per image, we generate far fewer but better targeted regions. We also propose a 'convolutional' variant which does away with region extraction altogether, and propose improvements to the density estimation phase used in both variants
- …