Display sets of normal and tree-child networks

DOI10.37236/9128zbMath1456.05154arXiv1901.06725OpenAlexW3118750855MaRDI QIDQ2223460

Simone Linz, Janosch Döcker, Charles Semple

Publication date: 29 January 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.06725

zbMATH Keywords

phylogenetic networksleaf-labelled directed acyclic graphs

Mathematics Subject Classification ID

Problems related to evolution (92D15) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Systems biology, networks (92C42)

Related Items (2)

Non-essential arcs in phylogenetic networks ⋮ Displaying trees across two phylogenetic networks

Uses Software

• PhyloNetworks

Cites Work

• Phylogenetic networks with every embedded phylogenetic tree a base tree
• Reticulation-visible networks
• Determining phylogenetic networks from inter-taxa distances
• On encodings of phylogenetic networks of bounded level
• Phylogenetic networks that display a tree twice
• A decomposition theorem and two algorithms for reticulation-visible networks
• Seeing the trees and their branches in the network is hard
• The polynomial-time hierarchy
• Solving the tree containment problem for reticulation-visible networks in linear time
• Locating a tree in a phylogenetic network
• Trinets encode tree-child and level-2 phylogenetic networks
• Displaying trees across two phylogenetic networks
• Counting phylogenetic networks
• Properties of normal phylogenetic networks
• Counting Trees in a Phylogenetic Network Is \#P-Complete

This page was built for publication: Display sets of normal and tree-child networks