Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-37195-0_8
Title: An optimal algorithm for building the majority rule consensus tree
Authors: Jansson, J.
Shen, C.
Sung, W.-K. 
Issue Date: 2013
Source: Jansson, J.,Shen, C.,Sung, W.-K. (2013). An optimal algorithm for building the majority rule consensus tree. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7821 LNBI : 88-99. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-37195-0_8
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.
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/40792
ISBN: 9783642371943
ISSN: 03029743
DOI: 10.1007/978-3-642-37195-0_8
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

2
checked on Dec 13, 2017

Page view(s)

219
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.