Algorithms for the majority rule (+) consensus tree and the frequency difference consensus tree

Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-40453-5_12

Title:	Algorithms for the majority rule (+) consensus tree and the frequency difference consensus tree
Authors:	Jansson, J. Shen, C. Sung, W.-K.
Issue Date:	2013
Citation:	Jansson, J.,Shen, C.,Sung, W.-K. (2013). Algorithms for the majority rule (+) consensus tree and the frequency difference consensus tree. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8126 LNBI : 141-155. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-40453-5_12
Abstract:	This paper 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 Ω(k n), and the second one constructs the frequency difference consensus tree in min {O(kn2), O(k n (k + log2n))} time. © 2013 Springer-Verlag.
Source Title:	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
URI:	http://scholarbank.nus.edu.sg/handle/10635/78002
ISBN:	9783642404528
ISSN:	03029743
DOI:	10.1007/978-3-642-40453-5_12
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check