Trinets encode tree-child and level-2 phylogenetic networks

  title={Trinets encode tree-child and level-2 phylogenetic networks},
  author={Leo van Iersel and Vincent Moulton},
  journal={Journal of Mathematical Biology},
  • L. Iersel, V. Moulton
  • Published 1 October 2012
  • Computer Science, Biology
  • Journal of Mathematical Biology
Phylogenetic networks generalize evolutionary trees, and are commonly used to represent evolutionary histories of species that undergo reticulate evolutionary processes such as hybridization, recombination and lateral gene transfer. Recently, there has been great interest in trying to develop methods to construct rooted phylogenetic networks from triplets, that is rooted trees on three species. However, although triplets determine or encode rooted phylogenetic trees, they do not in general… 
How Much Information is Needed to Infer Reticulate Evolutionary Histories?
It is shown that even if all of the building blocks for some reticulate evolutionary history were to be taken as the input for any given network building method, the method might still output an incorrect history.
Trinets encode orchard phylogenetic networks.
It is shown that trinets, phylogenetic network analogues of rooted triples, are sufficient to encode rooted binary orchard networks and affirmatively answers a previously-posed question of whether there is a polynomial-time algorithm for building a rooted binary tree-child network from the set of trinet it infers.
Generation of Binary Tree-Child phylogenetic networks
This paper addresses the problem of generating all possible binary tree-child networks with a given number of leaves in an efficient way via reduction/augmentation operations that extend and generalize analogous operations for phylogenetic trees, and are biologically relevant.
Display Sets of Normal and Tree-Child Networks
A polynomial-time algorithm is established for deciding if two binary phylogenetic networks embed the same set of phylogenetic trees, if the initial two networks consist of a normal network and a tree-child network; two well-studied topologically restricted subclasses of phylogenetics networks, with normal networks being more structurally constrained than tree- child networks.
An algorithm for reconstructing level-2 phylogenetic networks from trinets
This paper presents a polynomial-time algorithm for constructing a rooted binary level-2 phylogenetic network from a collection of 3-leaf networks or trinets and proves that the algorithm will correctly reconstruct such a network if it is given all of thetrinets in the network as input.
Classes of explicit phylogenetic networks and their biological and mathematical significance.
A thorough review of several subclasses of rooted phylogenetic networks (characterized by certain structural constraints) introduced in the literature, either to model specific biological phenomena or to enable tractable mathematical and computational analyses.
Do Branch Lengths Help to Locate a Tree in a Phylogenetic Network?
A number of versions of the tree containment problem that explicitly account for branch lengths are studied, showing that, although length information has the potential to locate more precisely a tree within a network, the problem is computationally hard in its most general form.
Constructing phylogenetic networks based on trinets
The SeqTrinet and TriLoNet methods are presented, which form a supernet- work based approach to constructing level-1 phylogenetic networks directly from multiple sequence alignments.
Phylogenetic networks that are their own fold-ups


Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets
This work shows that for a special, well-studied type of phylogenetic network, the trinets displayed by a 1-nested network always encode the network, which uses phylogenetic networks on 3-element subsets of a set, or trinet, rather than triplets.
Comparison of Tree-Child Phylogenetic Networks
An injective representation of these networks as multisets of vectors of natural numbers, their path multiplicity vectors are provided, and this representation is used to define a distance on this class that extends the well-known Robinson-Foulds distance for phylogenetic trees and to give an alignment method for pairs of networks in this class.
On encodings of phylogenetic networks of bounded level
Phylogenetic networks have now joined phylogenetic trees in the center of phylogenetics research. Like phylogenetic trees, such networks canonically induce collections of phylogenetic trees,
Phylogenetic Networks: Introduction to phylogenetic networks
This chapter gives an introduction to the topic of phylogenetics networks, very briefly describing the fundamental concepts and summarizing some of the most important methods that are available for the computation of phylogenetic networks.
When two trees go to war.
Evolutionary Phylogenetic Networks: Models and Issues
This chapter focuses less on surveying existing tools, and addresses in more detail issues that are central to the accurate reconstruction of phylogenetic networks, which explicitly model reticulate evolutionary events.
Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks
This work gives an exact algorithm for constructing level-1 networks consistent with a maximum number of input triplets, and proves that for all k > or = 1 it is NP-hard to construct a level-k network consistent with allinput triplets.
A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks
An efficient, practical algorithm for reconstructing level-1 phylogenetic networks-a type of network slightly more general than a phylogenetic tree-from triplets that is able to construct networks consistent with a high percentage of input triplets, even when theseinput triplets are affected by a low to moderate level of noise.
Phylogenetic Networks - Concepts, Algorithms and Applications
This book provides the first interdisciplinary overview of phylogenetic networks, beginning with a concise introduction to both phylogenetic trees and phylogenetic Networks, and presenting the fundamental concepts and results for both rooted and unrooted phylogenetics networks.
A distance metric for a class of tree-sibling phylogenetic networks
A distance measure on the class of semi-binary tree-sibling time consistent phylogenetic networks, which generalize tree-child time consistent evolutionary networks, and thus also galled-trees, which can be computed in polynomial time by means of simple algorithms.