On the maximum quartet distance between phylogenetic trees
نویسندگان
چکیده
A conjecture of Bandelt and Dress states that the maximum quartet distance between any two phylogenetic trees on n leaves is at most ( 23 + o(1)) ( n 4 ) . Using the machinery of flag algebras we improve the currently known bounds regarding this conjecture, in particular we show that the maximum is at most (0.69 + o(1)) ( n 4 ) . We also give further evidence that the conjecture is true by proving that the maximum distance between caterpillar trees is at most ( 2 3 + o(1)) ( n
منابع مشابه
On the compatibility of quartet trees
Phylogenetic tree reconstruction is a fundamental biological problem. Quartet trees, trees over four species, are the minimal informational unit for phylogenetic classification. While every phylogenetic tree over n species defines ( n 4 ) quartets, not every set of quartets is compatible with some phylogenetic tree. Here we focus on the compatibility of quartet sets. We provide several results ...
متن کاملComputing the Quartet Distance Between Trees of Arbitrary Degrees
Comparing trees with regard to their topology is in itself an interesting theoretical problem in computer science, and furthermore researchers working in the interdisciplinary field of computational biology need tools to compare phylogenetic trees, i.e. trees that describe the relation of species according to evolutionary history. Different methods and different information can result in differ...
متن کاملComputing the Quartet Distance Between Trees of Arbitrary Degree
We present two algorithms for computing the quartet distance between trees of arbitrary degree. The quartet distance between two unrooted evolutionary trees is the number of quartets—sub-trees induced by four leaves—that differs between the trees. Previous algorithms focus on computing the quartet distance between binary trees. In this paper, we present two algorithms for computing the quartet ...
متن کاملQDist-quartet distance between evolutionary trees
SUMMARY QDist is a program for computing the quartet distance between two unrooted trees, i.e. the number of quartet topology differences between the trees, where a quartet topology is the topological subtree induced by four species. The program is based on an algorithm with running time O(n log2 n), which makes it practical to compare large trees. Available under GNU license. AVAILABILITY ht...
متن کاملAlgorithms for Computing the Quartet Distance
Evolutionary (Phylogenetic) trees are constructs of the biological and medical sciences, their purpose is to establish the relationship between a set of species (phyla). Often it is the case that the true evolutionary tree is unknown and one can only try to estimate it. Reconstruction methods are manifold and the resulting evolutionary trees are not guaranteed to be correct. In order to establi...
متن کامل