title: Trinets encode tree-child and level-2 phylogenetic networks.
abstract: 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 encode rooted phylogenetic networks, which is a potential issue for any such method. Motivated by this fact, Huber and Moulton recently introduced trinets as a natural extension of rooted triplets to networks. In particular, they showed that [Formula: see text] phylogenetic networks are encoded by their trinets, and also conjectured that all "recoverable" rooted phylogenetic networks are encoded by their trinets. Here we prove that recoverable binary level-2 networks and binary tree-child networks are also encoded by their trinets. To do this we prove two decomposition theorems based on trinets which hold for all recoverable binary rooted phylogenetic networks. Our results provide some additional evidence in support of the conjecture that trinets encode all recoverable rooted phylogenetic networks, and could also lead to new approaches to construct phylogenetic networks from trinets.
authors.affiliation: Centrum Wiskunde & Informatica (CWI), P.O. Box 94079, 1090 GB , Amsterdam, The Netherlands, l.j.j.v.iersel@gmail.com.
authors.forename: Leo
authors.initials: L
authors.lastname: van Iersel
authors.forename: Vincent
authors.initials: V
authors.lastname: Moulton
mesh_terms: D000465:Algorithms; D005075:Biological Evolution; D053263:Gene Regulatory Networks; D049810:Genetic Speciation; D055641:Mathematical Concepts; D008957:Models, Genetic; D010802:Phylogeny