论文标题
在比较不同数量分类单元的分裂系统不兼容
On the comparison of incompatibility of split systems across different numbers of taxa
论文作者
论文摘要
$ k $兼容的概念衡量了在给定集中显示所有分裂所需的系统发育树。一组显示每一个可能的拆分的树被称为\ textit {uniseser tree set}。在本说明中，我们发现了$ a（n）$，这是$ n $分类的通用树的最小尺寸。通过使用$ a（n）$对$ k $ - 兼容性标准化，然后可以比较跨不同分类单元尺寸的拆分系统的不兼容。我们通过比较了来自古细菌基因组的不同大小的两个分散网络来证明这一应用。
The concept of $k$-compatibility measures how many phylogenetic trees it would take to display all splits in a given set. A set of trees that display every single possible split is termed a \textit{universal tree set}. In this note, we find $A(n)$, the minimal size of a universal tree set for $n$ taxa. By normalising the $k$-compatibility using $A(n)$, one can then compare incompatibility of split systems across different taxa sizes. We demonstrate this application by comparing two SplitsTree networks of different sizes derived from archaeal genomes.
