tqDist: a library for computing the quartet and triplet distances between binary or general trees
tqDist: a library for computing the quartet and triplet distances between binary or general trees
复制标题
DOI：
10.1093/bioinformatics/btu157
复制
发表时间：
2014-07-15
期刊：
影响因子：
5.8
通讯作者：
Pedersen, Christian N. S.
中科院分区：
文献类型：
--
作者：
Sand, Andreas;Holt, Morten K.;Pedersen, Christian N. S.
摘要：tqdist是一个用于计算一般有根树和无根树之间的三元组和四元组距离的软件包。该程序基于运行时间为O(Nlogn)的三元组距离计算算法和O(d.N log n)用于四元组距离计算，其中n是树中的叶数，d是具有最小度的树的度。无论是在理论上还是在实践中，这些都是目前最快的算法。
.Summary: tqDist is a software package for computing the triplet and quartet distances between general rooted or unrooted trees, respectively. The program is based on algorithms with running time O(n log n) for the triplet distance calculation and O(d . n log n) for the quartet distance calculation, where n is the number of leaves in the trees and d is the degree of the tree with minimum degree. These are currently the fastest algorithms both in theory and in practice.