Please use this identifier to cite or link to this item:
|Title:||Improved algorithms for constructing consensus trees||Authors:||Jansson, J.
|Issue Date:||2013||Citation:||Jansson, J.,Shen, C.,Sung, W.-K. (2013). Improved algorithms for constructing consensus trees. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms : 1800-1813. ScholarBank@NUS Repository.||Abstract:||A consensus tree is a single phylogenetic tree that summarizes the branching structure in a given set of conflicting phylogenetic trees. Many different types of consensus trees have been proposed in the literature; three of the most well-known and widely used ones are the majority rule consensus tree, the loose consensus tree, and the greedy consensus tree. This paper presents new deterministic algorithms for constructing them that are faster than all the previously known ones. Given k phylogenetic trees with n leaves each and with identical leaf label sets, our algorithms run in O(nk log k) time (majority rule consensus tree), O(nk) time (loose consensus tree), and O(n 2k) time (greedy consensus tree). Copyright © SIAM.||Source Title:||Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms||URI:||http://scholarbank.nus.edu.sg/handle/10635/78182||ISBN:||9781611972511|
|Appears in Collections:||Staff Publications|
Show full 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.