Improved algorithms for constructing consensus trees

Jesper Andreas Jansson; Chuanqi Shen; Wing Kin Sung

Improved algorithms for constructing consensus trees

Jesper Andreas Jansson, Chuanqi Shen, Wing Kin Sung

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

7 Citations (Scopus)

Abstract

A consensus tree is a single phylogenetic tree that summarizes the branching structure in a given set of conflicting phylogenetic trees. Many different types of consensus trees have been proposed in the literature; three of the most well-known and widely used ones are the majority rule consensus tree, the loose consensus tree, and the greedy consensus tree. This paper presents new deterministic algorithms for constructing them that are faster than all the previously known ones. Given k phylogenetic trees with n leaves each and with identical leaf label sets, our algorithms run in O(nk log k) time (majority rule consensus tree), O(nk) time (loose consensus tree), and O(n 2k) time (greedy consensus tree).

Original language	English
Title of host publication	Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013
Pages	1800-1813
Number of pages	14
Publication status	Published - 16 Apr 2013
Externally published	Yes
Event	24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013 - New Orleans, LA, United States Duration: 6 Jan 2013 → 8 Jan 2013

Conference

Conference	24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013
Country/Territory	United States
City	New Orleans, LA
Period	6/01/13 → 8/01/13

ASJC Scopus subject areas

Software
General Mathematics

Cite this

@inproceedings{4a2fba0839d84969bf675ee898c2d624,

title = "Improved algorithms for constructing consensus trees",

abstract = "A consensus tree is a single phylogenetic tree that summarizes the branching structure in a given set of conflicting phylogenetic trees. Many different types of consensus trees have been proposed in the literature; three of the most well-known and widely used ones are the majority rule consensus tree, the loose consensus tree, and the greedy consensus tree. This paper presents new deterministic algorithms for constructing them that are faster than all the previously known ones. Given k phylogenetic trees with n leaves each and with identical leaf label sets, our algorithms run in O(nk log k) time (majority rule consensus tree), O(nk) time (loose consensus tree), and O(n 2k) time (greedy consensus tree).",

author = "Jansson, {Jesper Andreas} and Chuanqi Shen and Sung, {Wing Kin}",

year = "2013",

month = apr,

day = "16",

language = "English",

isbn = "9781611972511",

pages = "1800--1813",

booktitle = "Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013",

note = "24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013 ; Conference date: 06-01-2013 Through 08-01-2013",

}

TY - GEN

T1 - Improved algorithms for constructing consensus trees

AU - Jansson, Jesper Andreas

AU - Shen, Chuanqi

AU - Sung, Wing Kin

PY - 2013/4/16

Y1 - 2013/4/16

N2 - A consensus tree is a single phylogenetic tree that summarizes the branching structure in a given set of conflicting phylogenetic trees. Many different types of consensus trees have been proposed in the literature; three of the most well-known and widely used ones are the majority rule consensus tree, the loose consensus tree, and the greedy consensus tree. This paper presents new deterministic algorithms for constructing them that are faster than all the previously known ones. Given k phylogenetic trees with n leaves each and with identical leaf label sets, our algorithms run in O(nk log k) time (majority rule consensus tree), O(nk) time (loose consensus tree), and O(n 2k) time (greedy consensus tree).

AB - A consensus tree is a single phylogenetic tree that summarizes the branching structure in a given set of conflicting phylogenetic trees. Many different types of consensus trees have been proposed in the literature; three of the most well-known and widely used ones are the majority rule consensus tree, the loose consensus tree, and the greedy consensus tree. This paper presents new deterministic algorithms for constructing them that are faster than all the previously known ones. Given k phylogenetic trees with n leaves each and with identical leaf label sets, our algorithms run in O(nk log k) time (majority rule consensus tree), O(nk) time (loose consensus tree), and O(n 2k) time (greedy consensus tree).

UR - http://www.scopus.com/inward/record.url?scp=84875545931&partnerID=8YFLogxK

M3 - Conference article published in proceeding or book

SN - 9781611972511

SP - 1800

EP - 1813

BT - Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013

T2 - 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013

Y2 - 6 January 2013 through 8 January 2013

ER -

Improved algorithms for constructing consensus trees

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this