Trinets encode tree-child and level-2 phylogenetic networks
From MaRDI portal
Publication:2249670
DOI10.1007/s00285-013-0683-5zbMath1339.92008arXiv1210.0362OpenAlexW2152997891WikidataQ47887748 ScholiaQ47887748MaRDI QIDQ2249670
Leo van Iersel, Vincent L. Moulton
Publication date: 3 July 2014
Published in: Journal of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.0362
Applications of graph theory (05C90) Developmental biology, pattern formation (92C15) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters ⋮ Combining Networks Using Cherry Picking Sequences ⋮ Classes of explicit phylogenetic networks and their biological and mathematical significance ⋮ Orchard networks are trees with additional horizontal arcs ⋮ Do branch lengths help to locate a tree in a phylogenetic network? ⋮ Distinguishing Phylogenetic Networks ⋮ An algorithm for reconstructing level-2 phylogenetic networks from trinets ⋮ Leaf-Reconstructibility of Phylogenetic Networks ⋮ Reconstruction of LGT networks from tri-LGT-nets ⋮ Labellable phylogenetic networks ⋮ A branching process approach to level‐k phylogenetic networks ⋮ Computing consensus networks for collections of 1-nested phylogenetic networks ⋮ Beyond representing orthology relations by trees ⋮ Phylogenetic Networks ⋮ Caterpillars on three and four leaves are sufficient to binary normal networks ⋮ Counting phylogenetic networks of level 1 and 2 ⋮ Display sets of normal and tree-child networks ⋮ Trinets encode orchard phylogenetic networks ⋮ Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes ⋮ Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets ⋮ A cubic-time algorithm for computing the trinet distance between level-1 networks ⋮ Reconstructing tree-child networks from reticulate-edge-deleted subnetworks ⋮ Phylogenetic networks that are their own fold-ups ⋮ Hierarchies from lowest stable ancestors in nonbinary phylogenetic networks ⋮ A class of phylogenetic networks reconstructable from ancestral profiles
Uses Software
Cites Work
- Unnamed Item
- On encodings of phylogenetic networks of bounded level
- Constructing the simplest possible phylogenetic network from triplets
- New results on optimizing rooted triplets consistency
- Path lengths in tree-child time consistent hybridization networks
- New common ancestor problems in trees and directed acyclic graphs
- Locating a tree in a phylogenetic network
- A framework for representing reticulate evolution
- When two trees go to war
- Encoding and constructing 1-nested phylogenetic networks with trinets
- Basic Phylogenetic Combinatorics
- The Structure of Level-k Phylogenetic Networks
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
