Please use this identifier to cite or link to this item:
https://doi.org/10.1007/978-3-642-15775-2_49
| DC Field | Value | |
|---|---|---|
| dc.title | Constructing the R* consensus tree of two trees in subcubic time | |
| dc.contributor.author | Jansson, J. | |
| dc.contributor.author | Sung, W.-K. | |
| dc.date.accessioned | 2013-07-04T08:21:20Z | |
| dc.date.available | 2013-07-04T08:21:20Z | |
| dc.date.issued | 2010 | |
| dc.identifier.citation | Jansson, J.,Sung, W.-K. (2010). Constructing the R* consensus tree of two trees in subcubic time. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6346 LNCS (PART 1) : 573-584. ScholarBank@NUS Repository. <a href="https://doi.org/10.1007/978-3-642-15775-2_49" target="_blank">https://doi.org/10.1007/978-3-642-15775-2_49</a> | |
| dc.identifier.isbn | 3642157742 | |
| dc.identifier.issn | 03029743 | |
| dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/41174 | |
| dc.description.abstract | The previously fastest algorithms for computing the R*consensus tree of two given (rooted) phylogenetic trees T 1 and T 2 with a leaf label set of cardinality n run in Θ(n 3) time [3,8]. In this manuscript, we describe a new O(n 2 log n)-time algorithm to solve the problem. This is a significant improvement because the R* consensus tree is defined in terms of a set ℛ maj which may contain Ω(n 3) elements, so any direct approach which explicitly constructs ℛ maj requires Ω(n 3) time. © 2010 Springer-Verlag. | |
| dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/978-3-642-15775-2_49 | |
| dc.source | Scopus | |
| dc.type | Conference Paper | |
| dc.contributor.department | COMPUTER SCIENCE | |
| dc.description.doi | 10.1007/978-3-642-15775-2_49 | |
| dc.description.sourcetitle | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |
| dc.description.volume | 6346 LNCS | |
| dc.description.issue | PART 1 | |
| dc.description.page | 573-584 | |
| 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.