License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2018.63
URN: urn:nbn:de:0030-drops-90676
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9067/
Go to the corresponding LIPIcs Volume Portal


Gawrychowski, Pawel ; Landau, Gad M. ; Sung, Wing-Kin ; Weimann, Oren

A Faster Construction of Greedy Consensus Trees

pdf-format:
LIPIcs-ICALP-2018-63.pdf (0.5 MB)


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 difference consensus tree. Given k conflicting trees each with n leaves, the previous fastest algorithms for these problems were O(k n^2) for the greedy consensus tree [J. ACM 2016] and O~(min{k n^2, k^2n}) for the frequency difference consensus tree [ACM TCBB 2016]. We improve these running times to O~(k n^{1.5}) and O~(k n) respectively.

BibTeX - Entry

@InProceedings{gawrychowski_et_al:LIPIcs:2018:9067,
  author =	{Pawel Gawrychowski and Gad M. Landau and Wing-Kin Sung and Oren Weimann},
  title =	{{A Faster Construction of Greedy Consensus Trees}},
  booktitle =	{45th International Colloquium on Automata, Languages, and  Programming (ICALP 2018)},
  pages =	{63:1--63:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-076-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{107},
  editor =	{Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'a}niel Marx and Donald Sannella},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9067},
  URN =		{urn:nbn:de:0030-drops-90676},
  doi =		{10.4230/LIPIcs.ICALP.2018.63},
  annote =	{Keywords: phylogenetic trees, greedy consensus trees, dynamic trees}
}

Keywords: phylogenetic trees, greedy consensus trees, dynamic trees
Seminar: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Issue Date: 2018
Date of publication: 29.06.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI