Non-essential arcs in phylogenetic networks

DOI10.1016/j.jcss.2022.02.005OpenAlexW4287074131MaRDI QIDQ2136848

Simone Linz, Charles Semple

Publication date: 16 May 2022

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

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

zbMATH Keywords

phylogenetic networktree-child\(\Pi_2^P\)-completecaterpillar ladderdisplaying treesnon-essential arc

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (1)

Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Phylogenetic networks with every embedded phylogenetic tree a base tree
• Reticulation-visible networks
• On determining if tree-based networks contain fixed trees
• Phylogenetic networks that display a tree twice
• Reconstructing evolution of sequences subject to recombination using parsimony
• Seeing the trees and their branches in the network is hard
• The polynomial-time hierarchy
• Solving the tree containment problem in linear time for nearly stable phylogenetic networks
• Locating a tree in a phylogenetic network
• On unrooted and root-uncertain variants of several well-known phylogenetic network problems
• Display sets of normal and tree-child networks
• Displaying trees across two phylogenetic networks
• Counting phylogenetic networks
• Counting Trees in a Phylogenetic Network Is \#P-Complete
• On Computing the Maximum Parsimony Score of a Phylogenetic Network

This page was built for publication: Non-essential arcs in phylogenetic networks