New characterisations of tree-based networks and proximity measures
From MaRDI portal
Publication:2411310
DOI10.1016/j.aam.2017.08.003zbMath1372.05034arXiv1611.04225OpenAlexW2963197845MaRDI QIDQ2411310
Charles Semple, Mike A. Steel, Andrew R. Francis
Publication date: 20 October 2017
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.04225
Trees (05C05) Problems related to evolution (92D15) Transversal (matching) theory (05D15) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items
Distinguishing Phylogenetic Networks, Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks, Forest-based networks, The space of tree-based phylogenetic networks, How tree-based is my network? Proximity measures for unrooted phylogenetic networks, How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks, Phylogenetic Networks, Tree-based networks: characterisations, metrics, and support trees, Tree-based unrooted phylogenetic networks, Tree-based unrooted nonbinary phylogenetic networks, When is a phylogenetic network simply an amalgamation of two trees?, A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based Networks, Phylogenetic networks that are their own fold-ups, A unifying characterization of tree-based networks and orchard networks using cherry covers
Cites Work
- Unnamed Item
- Phylogenetic networks with every embedded phylogenetic tree a base tree
- On the existence of infinitely many universal tree-based networks
- On determining if tree-based networks contain fixed trees
- A decomposition theorem for partially ordered sets
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
