Reticulation-visible networks

DOI10.1016/j.aam.2016.04.004zbMath1335.05170arXiv1508.05424OpenAlexW2964159213MaRDI QIDQ281904

Magnus Bordewich, Charles Semple

Publication date: 11 May 2016

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

phylogenetic networkreticulation-visible networktree containment problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (17)

Non-essential arcs in phylogenetic networks ⋮ Classes of explicit phylogenetic networks and their biological and mathematical significance ⋮ Solving the tree containment problem in linear time for nearly stable phylogenetic networks ⋮ Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks ⋮ Tree Containment With Soft Polytomies ⋮ Counting and enumerating galled networks ⋮ Counting and enumerating tree-child networks and their subclasses ⋮ A QUBO formulation for the tree containment problem ⋮ Display sets of normal and tree-child networks ⋮ When is a phylogenetic network simply an amalgamation of two trees? ⋮ Size of a phylogenetic network ⋮ On unrooted and root-uncertain variants of several well-known phylogenetic network problems ⋮ Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks ⋮ Phylogenetic networks that are their own fold-ups ⋮ A decomposition theorem and two algorithms for reticulation-visible networks ⋮ Unnamed Item ⋮ Displaying trees across two phylogenetic networks

Cites Work

• Seeing the trees and their branches in the network is hard
• Locating a tree in a phylogenetic network
• Locating a Tree in a Phylogenetic Network in Quadratic Time
• Unnamed Item

This page was built for publication: Reticulation-visible networks