Let T1 and T2 be two unrooted evolutionary trees on the same set S of species, and let all internal nodes in the trees have degree three. Then the quartet distance between T1 and T2 can be found in time O(n log2 n).
We present an algorithm for calculating the quartet distance between two evolutionary trees of bounded degree on a common set of n species.
We present an algorithm for calculating the quartet distance between two evolutionary trees of bounded degree on a common set of n species.
Abstract: We present an algorithm for calculating the quartet distance between two evolutionary trees of bounded degree on a common set of n species.
PDF | this paper, we study the quartet metric, which is based on common subtrees induced by four leaves. This metric has several attractive properties,.
The quartet distance between two unrooted evolutionary trees is the number of quartet topol- ogy differences between the two trees, where a quartet topology is ...
An algorithm for computing the quartet distance between two unrooted evolutionary trees of n species, where all internal nodes have degree three, ...
People also ask
What is the quartet distance?
What is the evolutionary distance of a phylogenetic tree?
In this paper, we present two algorithms for computing the quartet distance between trees of arbitrary degrees. One in time O(n3) and space O(n2) and one in ...
Dec 2, 2020 · There exists an algorithm for computing the quartet distance between two trees on n leaves and all internal nodes having degrees bounded by d in ...
Algorithms in Molecular Biology 2011. ▫ Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree. M. Stissing, C.N.S. Pedersen, T. Mailund ...