@inproceedings{27c6e8e7bf44419592a49205c572ec60,
title = "Faster algorithms for computing the R* Consensus tree",
abstract = "The fastest known algorithms for computing the R* consensus tree of k rooted phylogenetic trees with n leaves each and identical leaf label sets run in O(n2 √ log n) time when k = 2 (ref. [10]) and O(kn3) time when k ≥ 3 (ref. [4]). This paper shows how to compute it in O(n2) time for k = 2, O(n2 log4/3n) time for k = 3, and O(n2 logk+2n) time for unbounded k.",
author = "Jansson, {Jesper Andreas} and Sung, {Wing Kin} and Hoa Vu and Yiu, {Siu Ming}",
year = "2014",
month = jan,
day = "1",
doi = "10.1007/978-3-319-13075-0_33",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "414--425",
editor = "Hee-Kap Ahn and Chan-Su Shin",
booktitle = "Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings",
note = "25th International Symposium on Algorithms and Computation, ISAAC 2014 ; Conference date: 15-12-2014 Through 17-12-2014",
}