Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree

IEEE/ACM Transactions on Computational Biology and Bioinformatics

5 years ago

Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree

Chuanqi Shen, Wing-Kin Sung, Ramesh Rajaby, , Jesper Jansson

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(k n)$

time, which is optimal since the input size is

$Omega (k n)$

, and the second one constructs the frequency difference consensus tree in

$min lbrace O(k n^{2}), O(k n (k + log ^{2}n))rbrace$

time.

Publisher URL: http://ieeexplore.ieee.org/document/7572103

DOI: 7572103

You might also like

Discover & Discuss Important Research

Keeping up-to-date with research can feel impossible, with papers being published faster than you'll ever be able to read them. That's where Researcher comes in: we're simplifying discovery and making important discussions happen. With over 19,000 sources, including peer-reviewed journals, preprints, blogs, universities, podcasts and Live events across 10 research areas, you'll never miss what's important to you. It's like social media, but better. Oh, and we should mention - it's free.

Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.