@inproceedings{34305421fdb744d6b88c02f7de3d1369,
title = "A faster construction of greedy consensus trees",
abstract = "A consensus tree is a phylogenetic tree that captures the similarity between a set of conflicting phylogenetic trees. The problem of computing a consensus tree is a major step in phylogenetic tree reconstruction. It is also central for predicting a species tree from a set of gene trees, as indicated recently in [Nature 2013]. This paper focuses on two of the most well-known and widely used consensus tree methods: the greedy consensus tree and the frequency di erence consensus tree. Given k conflicting trees each with n leaves, the previous fastest algorithms for these problems were O(kn2) for the greedy consensus tree [J. ACM 2016] and O(min(kn2, k2n)) for the frequency di erence consensus tree [ACM TCBB 2016]. We improve these running times to O(kn1.5) and O(kn) respectively.",
keywords = "Dynamic trees, Greedy consensus trees, Phylogenetic trees",
author = "Pawe{\l} Gawrychowski and Landau, {Gad M.} and Sung, {Wing Kin} and Oren Weimann",
note = "Publisher Copyright: {\textcopyright} Pawe{\l} Gawrychowski, Gad M. Landau, Wing-Kin Sung, and Oren Weimann;.; 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018 ; Conference date: 09-07-2018 Through 13-07-2018",
year = "2018",
month = jul,
day = "1",
doi = "10.4230/LIPIcs.ICALP.2018.63",
language = "American English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Christos Kaklamanis and Daniel Marx and Ioannis Chatzigiannakis and Donald Sannella",
booktitle = "45th International Colloquium on Automata, Languages, and Programming, ICALP 2018",
address = "Germany",
}