An optimal algorithm for building the majority rule consensus tree
Jansson, J. Shen, C. Sung, W.-K.
Jansson, J.
Shen, C.
Citations
Altmetric:
Alternative Title
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(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. © 2013 Springer-Verlag.
Keywords
Source Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher
Series/Report No.
Collections
Rights
Date
2013
DOI
10.1007/978-3-642-37195-0_8
Type
Conference Paper