An optimal algorithm for building the majority rule consensus tree

Authors:
Jesper Jansson;Chuanqi Shen;Wing-Kin Sung
Affiliations:
Laboratory of Mathematical Bioinformatics (Akutsu Laboratory), Institute for Chemical Research, Kyoto University, Uji, Kyoto, Japan;Stanford University, Stanford, CA;School of Computing, National University of Singapore, Singapore,Genome Institute of Singapore, Genome, Singapore
Venue:
RECOMB'13 Proceedings of the 17th international conference on Research in Computational Molecular Biology
Year:
2013

Citing 4
Cited 0

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms in Bioinformatics: A Practical Introduction

Algorithms in Bioinformatics: A Practical Introduction
DendroPy

Bioinformatics
Comparing and aggregating partially resolved trees

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A deterministic algorithm for building the majority rule consensus tree of an input collection of conflicting phylogenetic trees with identical leaf labels is presented. Its worst-case running time is O(nk), where n is the size of the leaf label set and k is the number of input phylogenetic trees. This is optimal since the input size is Ω(nk). Experimental results show that the algorithm is fast in practice.