Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-37195-0_8
DC FieldValue
dc.titleAn optimal algorithm for building the majority rule consensus tree
dc.contributor.authorJansson, J.
dc.contributor.authorShen, C.
dc.contributor.authorSung, W.-K.
dc.date.accessioned2013-07-04T08:12:27Z
dc.date.available2013-07-04T08:12:27Z
dc.date.issued2013
dc.identifier.citationJansson, 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. <a href="https://doi.org/10.1007/978-3-642-37195-0_8" target="_blank">https://doi.org/10.1007/978-3-642-37195-0_8</a>
dc.identifier.isbn9783642371943
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/40792
dc.description.abstractA 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/978-3-642-37195-0_8
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1007/978-3-642-37195-0_8
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume7821 LNBI
dc.description.page88-99
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

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

Google ScholarTM

Check

Altmetric


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