Advertisement
Published in:
2013 | OriginalPaper | Chapter
An Optimal Algorithm for Building the Majority Rule Consensus Tree
Authors : Jesper Jansson, Chuanqi Shen, Wing-Kin Sung
Published in: Research in Computational Molecular Biology
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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
(
n
k
), 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 Ω(
n
k
). Experimental results show that the algorithm is fast in practice.