Index Terms
- Time, but faster
Recommendations
Faster exact computation of rSPR distance
Due to hybridization events in evolution, studying two different genes of a set of species may yield two related but different phylogenetic trees for the set of species. In this case, we want to measure the dissimilarity of the two trees. The rooted ...
Faster Algorithms for Computing the R* Consensus Tree
The fastest known algorithms for computing the R* consensus tree of k rooted phylogenetic trees with n leaves each and identical leaf label sets run in $$O(n^{2} \sqrt{\log n})$$O(n2logn) time when $$k = 2$$k=2 (Jansson and Sung in Algorithmica 66(2):...
A Faster Algorithm for Computing the Kernel of Maximum Agreement Subtrees
The maximum agreement subtree method determines the consensus of a collection of phylogenetic trees by identifying maximum cardinality subsets of leaves for which all input trees agree. The trees induced by these maximum cardinality subsets are maximum ...
Comments