An optimal algorithm for building the majority rule consensus tree

Jesper Andreas Jansson, Chuanqi Shen, Wing Kin Sung

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

2 Citations (Scopus)

Abstract

A deterministic algorithm for building the majority rule consensus tree of an input collection of conflicting phylogenetic trees with identical leaf labels is presented. Its worst-case running time is O(n k), where n is the size of the leaf label set and k is the number of input phylogenetic trees. This is optimal since the input size is Ω(n k). Experimental results show that the algorithm is fast in practice.
Original languageEnglish
Title of host publicationResearch in Computational Molecular Biology - 17th Annual International Conference, RECOMB 2013, Proceedings
Pages88-99
Number of pages12
DOIs
Publication statusPublished - 3 Apr 2013
Externally publishedYes
Event17th Annual International Conference on Research in Computational Molecular Biology, RECOMB 2013 - Beijing, China
Duration: 7 Apr 201310 Apr 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7821 LNBI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th Annual International Conference on Research in Computational Molecular Biology, RECOMB 2013
Country/TerritoryChina
CityBeijing
Period7/04/1310/04/13

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this