返回
Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree
DOI:10.1109/TCBB.2016.2609923.png)
摘要
En 中文
This article presents two new deterministic algorithms for constructing consensus trees. Given an input of k phylogenetic trees with identical leaf label sets and n leaves each, the first algorithm constructs the majority rule (+) consensus tree in O(kn) time, which is optimal since the input size is Omega(kn), and the second one constructs the frequency difference consensus tree in min {O(kn(2)); O(kn(k + log(2) n))} time.
Keyword:
Phylogenetic tree
consensus tree
cluster
pairwise compatibility
tree algorithm
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.4
论文数:
3.3K
被引数:
6.4K
机构
引用论文
Axiomatic Opportunities and Obstacles for Inferring a Species Tree from Gene Trees
SYSTEMATIC BIOLOGY
IF5.7

