Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks

DOI10.1016/j.aam.2023.102595zbMath1526.92038arXiv2211.06549OpenAlexW4385679613MaRDI QIDQ6056548

Janosch Döcker, Charles Semple, Simone Linz

Publication date: 30 October 2023

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

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

zbMATH Keywords

hypercubeHamilton cyclesubtree prune and regraftphylogenetic networkgray codedisplay set

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Faster computation of the Robinson-Foulds distance between phylogenetic networks
• Optimal algorithms for comparing trees with labeled leaves
• On the complexity of testing a graph for n-cube
• Another characterization of hypercubes
• Locating a tree in a phylogenetic network
• On the computational complexity of the rooted subtree prune and regraft distance
• A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees
• Non-essential arcs in phylogenetic networks
• Classes of explicit phylogenetic networks and their biological and mathematical significance
• Counting phylogenetic networks
• Bounding the number of hybridisation events for a consistent evolutionary history
• Efficiently Inferring Pairwise Subtree Prune-and-Regraft Adjacencies between Phylogenetic Trees
• Comparison of labeled trees with valency three
• Research in Computational Molecular Biology
• Efficient algorithms for inferring evolutionary trees
• Subtree transfer operations and their induced metrics on evolutionary trees
• On the complexity of comparing evolutionary trees
• Combinatorial Gray codes -- an updated survey

This page was built for publication: Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks