Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree
Data Structures and Algorithms
2013-08-07 v2 Computational Engineering, Finance, and Science
Quantitative Methods
Abstract
This paper 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
Cite
@article{arxiv.1307.7821,
title = {Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree},
author = {Jesper Jansson and Chuanqi Shen and Wing-Kin Sung},
journal= {arXiv preprint arXiv:1307.7821},
year = {2013}
}
Comments
Peer-reviewed and presented as part of the 13th Workshop on Algorithms in Bioinformatics (WABI2013)