4 Result(s)
-
Article
Fast Compatibility Testing for Rooted Phylogenetic Trees
We present a new graph-based approach to the following basic problem in phylogenetic tree construction. Let $$\mathcal {P}= \{T_1, \ld...
-
Article
EvoMiner: frequent subtree mining in phylogenetic databases
The problem of mining collections of trees to identify common patterns, called frequent subtrees (FSTs), arises often when trying to interpret the results of phylogenetic analysis. FST mining generalizes the w...
-
Article
Editorial
-
Article
On the efficiency of maximum-flow algorithms on networks with small integer capacities
The performance of maximum-flow algoirthms that work in phases is studied as a function of the maximum arc capacity,C, of the network and a quantity we call thetotal potential, P, of the network, which is related...
