Algorithms for building consensus MUL-trees

Authors:
Yun Cui;Jesper Jansson;Wing-Kin Sung
Affiliations:
National University of Singapore, Singapore;Ochanomizu University, Tokyo, Japan;National University of Singapore, Singapore
Venue:
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Year:
2011

Citing 7
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Pattern Identification in Biogeography

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
PADRE

Bioinformatics
Algorithms in Bioinformatics: A Practical Introduction

Algorithms in Bioinformatics: A Practical Introduction
Building species trees from larger parts of phylogenomic databases

Information and Computation
Metrics on Multilabeled Trees: Interrelationships and Diameter Bounds

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A MUL-tree is a generalization of a phylogenetic tree that allows the same leaf label to be used many times. Lott et al. [9,10] recently introduced the problem of inferring a so-called consensus MUL-tree from a set of conflicting MUL-trees and gave an exponential-time algorithm for a special greedy variant. Here, we study strict and majority rule consensus MUL-trees , and present the first ever polynomial-time algorithms for building a consensus MUL-tree. We give a simple, fast algorithm for building a strict consensus MUL-tree. We also show that although it is NP-hard to find a majority rule consensus MUL-tree, the variant which we call the singular majority rule consensus MUL-tree is unique and can be constructed efficiently.