Please use this identifier to cite or link to this item:
https://doi.org/10.1007/978-3-642-37195-0_8
DC Field | Value | |
---|---|---|
dc.title | An optimal algorithm for building the majority rule consensus tree | |
dc.contributor.author | Jansson, J. | |
dc.contributor.author | Shen, C. | |
dc.contributor.author | Sung, W.-K. | |
dc.date.accessioned | 2013-07-04T08:12:27Z | |
dc.date.available | 2013-07-04T08:12:27Z | |
dc.date.issued | 2013 | |
dc.identifier.citation | 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. <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.isbn | 9783642371943 | |
dc.identifier.issn | 03029743 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/40792 | |
dc.description.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. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/978-3-642-37195-0_8 | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | COMPUTER SCIENCE | |
dc.description.doi | 10.1007/978-3-642-37195-0_8 | |
dc.description.sourcetitle | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |
dc.description.volume | 7821 LNBI | |
dc.description.page | 88-99 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.