TY - GEN
T1 - An optimal algorithm for building the majority rule consensus tree
AU - Jansson, Jesper Andreas
AU - Shen, Chuanqi
AU - Sung, Wing Kin
PY - 2013/4/3
Y1 - 2013/4/3
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84875532663&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-37195-0_8
DO - 10.1007/978-3-642-37195-0_8
M3 - Conference article published in proceeding or book
SN - 9783642371943
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 88
EP - 99
BT - Research in Computational Molecular Biology - 17th Annual International Conference, RECOMB 2013, Proceedings
T2 - 17th Annual International Conference on Research in Computational Molecular Biology, RECOMB 2013
Y2 - 7 April 2013 through 10 April 2013
ER -