Computing a Consensus of Multilabeled Trees

  title={Computing a Consensus of Multilabeled Trees},
  author={Katharina T. Huber and Vincent Moulton and Andreas Spillner and Sabine Storandt and Radosław Suchecki},
In this paper we consider two challenging problems that arise in the context of computing a consensus of a collection of multilabeled trees, namely (1) selecting a compatible collection of clusters on a multiset from an ordered list of such clusters and (2) optimally refining high degree vertices in a multilabeled tree. Forming such a consensus is part of an approach to reconstruct the evolutionary history of a set of species for which events such as genome duplication and hybridization have… 

Figures from this paper

Improved Algorithms for Constructing Consensus Trees

New deterministic algorithms for constructing consensus trees that are faster than all the previously known ones are presented, and are optimal since the input size is Ω(nk).

Polynomial-Time Algorithms for Building a Consensus MUL-Tree

This work considers the problem of inferring a consensus MUL-tree that summarizes a given set of conflicting Mul-trees, and presents the first polynomial-time algorithms for solving it, and shows that, although it is NP-hard to find a majority rule consensus Mulu-tree in general, the variant can be constructed efficiently whenever it exists.

The hybrid number of a ploidy profile

The novel concept of a ploidy profile is introduced which allows it to formalize it in terms of a multiplicity vector indexed by the species the dataset is comprised of and is applied to a simplified version of a publicly available Viola dataset.

Inferring species trees from incongruent multi-copy gene trees using the Robinson-Foulds distance

It is proved that it is NP-hard to compute the RF distance between two mul-trees; however, it is easy to calculate this distance between a mul-tree and a singly-labeled species tree, and MulRF is presented as an efficient alternative approach for phylogenetic inference from large-scale genomic data sets.

Folding and unfolding phylogenetic trees and networks

The class of stable networks, phylogenetic networks N for which F(U(N)) is isomorphic to N, is introduced, characterise such networks, and show that they are related to the well-known class of tree-sibling networks.

Phylogenetic networks that are their own fold-ups

Predicting the Evolution of Syntenies - An Algorithmic Review

This paper reviews some of the main algorithmic methods for inferring ancestral syntenies and focus on those integrating both gene orders and gene trees.

Enumerating all maximal frequent subtrees in collections of phylogenetic trees

Algorithms and experimental results confirm that maximal agreement subtrees and all maximal frequent subtrees can reveal a more complete phylogenetic picture of the common patterns in collections of phylogenetic trees than maximum agreement subtree; they are also often more resolved than the majority rule tree.



Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets

It is proved that even the very restricted case of determining if there exists a MUL tree consistent with the input and having just one leaf duplication is an NP-hard problem, and the general minimization problem is difficult to approximate.

The Complexity of Deriving Multi-Labeled Trees from Bipartitions

It is shown that it is NP-hard to decide whether a collection of bipartitions of a multiset can be represented by a multi-labeled tree, and a fixed-parameter algorithm is obtained in terms of a parameter associated to the given multisets.

Inferring polyploid phylogenies from multiply-labeled gene trees

A heuristic method for computing a consensus tree of multiply-labeled trees and illustrates the applicability of the method using two collections of trees for plants of the genus Silene, that involve several allopolyploids at different levels.

From Gene Trees to Species Trees through a Supertree Approach

This work proposes a novel approach to tackle the problem of inferring a species tree from a set of multi-labeled gene trees, mainly to transform a collection of MUL trees into aCollection of evolutionary trees, each containing single copies of labels.

Phylogenetic networks from multi-labelled trees

Based on the knowledge of a multi-labelled tree relating collection of polyploids, this work presents a canonical construction of a phylogenetic network that exhibits the tree and proves that the resulting network is in some well-defined sense a minimal network having this property.

The probabilities of rooted tree-shapes generated by random bifurcation

  • E. Harding
  • Mathematics, Computer Science
    Advances in Applied Probability
  • 1971
The account of enumeration collates much previous work and attempts a complete perspective of the problems and their solutions of attempting to reconstruct evolutionary trees by the statistical approach of Cavalli-Sforza and Edwards.

Allopolyploidization and evolution of species with reduced floral structures in Lepidium L. (Brassicaceae)

Phylogenetic analysis of the PI intron suggests that many species in the New World have originated from allopolyploidization, and that this is correlated with floral reduction, and interspecific hybrids were generated to understand why allopolyPloidization is associated with reduced flowers.

Origin and Evolution of a Circumpolar Polyploid Species Complex in Silene (Caryophyllaceae) Inferred from Low Copy Nuclear RNA Polymerase Introns, rDNA, and Chloroplast DNA

Phylogenetic analyses of two chloroplast and five putatively unlinked nuclear DNA regions were used to explore the evolutionary relationships of a circumpolar arctic polyploid species complex in Silene, showing small deviations from the general pattern explained by alloploidy.