A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based Networks
From MaRDI portal
Publication:5163512
DOI10.1137/19M1297403zbMath1475.92117arXiv1811.05849MaRDI QIDQ5163512
Publication date: 4 November 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.05849
optimizationenumerationcountingphylogenetic treephylogenetic networksubdivision treetree-based networkdecision/searchdeviation quantification
Related Items (1)
Cites Work
- 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
- On generating all maximal independent sets
- Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution
- Locating a tree in a phylogenetic network
- Tree-based networks: characterisations, metrics, and support trees
- Tree-based unrooted phylogenetic networks
- A universal tree-based network with the minimum number of reticulations
- Tree-based unrooted nonbinary phylogenetic networks
- How tree-based is my network? Proximity measures for unrooted phylogenetic networks
- New characterisations of tree-based networks and proximity measures
- Unrooted non-binary tree-based phylogenetic networks
- Ordered Sets
- Phylogeny
- Counting Trees in a Phylogenetic Network Is \#P-Complete
- Efficient Algorithms for Listing Combinatorial Structures
- The Complexity of Enumeration and Reliability Problems
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication: A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based Networks
