Hybridization in Nonbinary Trees

  title={Hybridization in Nonbinary Trees},
  author={Simone Linz and Charles Semple},
  journal={IEEE/ACM Transactions on Computational Biology and Bioinformatics},
  • S. Linz, C. Semple
  • Published 2009
  • Biology
  • IEEE/ACM Transactions on Computational Biology and Bioinformatics
Reticulate evolution - the umbrella term for processes like hybridization, horizontal gene transfer, and recombination - plays an important role in the history of life of many species. Although the occurrence of such events is widely accepted, approaches to calculate the extent to which reticulation has influenced evolution are relatively rare. In this paper, we show that the NP-hard problem of calculating the minimum number of reticulation events for two (arbitrary) rooted phylogenetic trees… 

Figures from this paper

Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees

Simulation results on biological and simulated datasets show that the new practical method presented is more efficient and robust than an existing method to compute the exact hybridization number.

On the Elusiveness of Clusters

It is proved that, for every fixed k ≥ 0, it is polynomial-time solvable to construct a phylogenetic network with level equal to k representing a cluster set, or to determine that no such network exists.

Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees

  • Y. Wu
  • Computer Science
  • 2010
The lower and upper bounds match for many datasets (especially when the number of trees is small or reticulation level is low), and this allows the minimum reticulate network problem exactly for these datasets.

Supertrees Based on the Subtree Prune-and-Regraft Distance

This work successfully constructed an SPR supertree from a phylogenomic dataset of 40,631 gene trees that covered 244 genomes representing several major bacterial phyla, and allowed direct inference of highways of gene transfer between bacterial classes and genera.

Autumn Algorithm—Computation of Hybridization Networks for Realistic Phylogenetic Trees

  • D. HusonS. Linz
  • Computer Science
    IEEE/ACM Transactions on Computational Biology and Bioinformatics
  • 2018
A new algorithm for computing minimum hybridization networks for a given pair of “realistic” rooted phylogenetic trees is presented, and the concept of "autumn trees" is introduced, a nice framework for the formulation of algorithms based on the mathematics of "maximum acyclic agreement forests".

When two trees go to war.

A quadratic kernel for computing the hybridization number of multiple trees

Improving the Approximation Ratio of the Maximum Agreement Forest (MAF) on k trees and Estimating the Approximation Ratio of the Acyclic-MAF on k trees

A better approximation ratio is given for the MAF on k trees and an approximation ratio for Maximum Acyclic Agreement Forest (MAAF) on k (≥2) trees is provided.

Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters

The new Cass algorithm is presented, which is a generalization of phylogenetic trees that can combine any set of clusters into a phylogenetic network, and it is shown that the networks constructed by Cass are usually simpler than Networks constructed by other available methods.

Frin: An Efficient Method for Representing Genome Evolutionary History

The experimental results show that the networks constructed by Frin are not only simpler than those constructed by other methods, but Frin can also construct more consistent phylogenetic networks when the treated data have different input orders.



Reticulation in evolution

The main focus of this thesis is to develop new biologically motivated theoretical frameworks that provide insight into the extent to which reticulation events have influenced evolution, and presents a new likelihood framework to estimate a rate of HGT for a set of taxa.

Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable

This paper shows that the problem is fixed-parameter tractable in the two-tree instance when parameterized by this smallest number of reticulation vertices, which is NP-hard even when the collection consists of only two rooted binary phylogenetic trees.

Bounding the Number of Hybridisation Events for a Consistent Evolutionary History

In this paper, the theoretical performance of some related bounds that result when merging pairs of trees into networks are described.

Parsimonious Reconstruction of Sequence Evolution and Haplotype Blocks

This work considers the problem of finding the minimum number of recombination events which must have occurred in the evolutionary history of sampled DNA sequences and develops a deterministic approach based on the combinatorics of leaf-labelled rooted trees.

Hybridization as an invasion of the genome.

  • J. Mallet
  • Biology
    Trends in ecology & evolution
  • 2005


New algorithms for both ordered and unordered characters are presented to reconstruct character evolution under the uncertain‐resolution interpretation of polytomies, which allow the cladogram to resolve itself so as to be favourable for the character whose evolution is being reconstructed.

Phylogenetic relationships and biogeography of Ranunculus and allied genera (Ranunculaceae) in the Mediterranean region and in the European Alpine System

The results from this study suggest that the split of allied genera from Ranunculus s.l.s. occurred during the Eocene and Oligocene, and a hypothesis of an origin of alpine buttercups from lowland ancestors of the same geographical region is supported.

Hybrids in real time.

A simple result is presented to show that, despite the presence of Reticulation, there is always a well-defined underlying tree that corresponds to those parts of life that do not have a history of reticulation.