.png){kind=icon}
.png){kind=icon}
Return
Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree
.png){kind=icon}
OA
AI
DOI：10.1109/TCBB.2016.2609923.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Phylogenetic tree
consensus tree
cluster
pairwise compatibility
tree algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
3.4
Papers:
3.3K
Citations:
6.4K
View more organizations