Exploring spaces of semi-directed level-1 networks
From MaRDI portal
Publication:6057997
DOI10.1007/s00285-023-02004-5zbMath1525.05176arXiv2301.10818OpenAlexW4387597327MaRDI QIDQ6057997
Publication date: 26 October 2023
Published in: Journal of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2301.10818
Problems related to evolution (92D15) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Cites Work
- Transforming phylogenetic networks: moving beyond tree space
- Identifying species network features from gene tree quartets under the coalescent model
- Bounds for phylogenetic network space metrics
- On the computational complexity of the rooted subtree prune and regraft distance
- Exploring the tiers of rooted phylogenetic network space using tail moves
- Identifiability of local and global features of phylogenetic networks from average distances
- Identifiability of species network topologies from genomic sequences using the logDet distance
- Identifiability in phylogenetics using algebraic matroids
- Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes
- Counting phylogenetic networks
- Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks
- Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations
- Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks
- The agreement distance of unrooted phylogenetic networks
- Distinguishing Phylogenetic Networks
- The SNPR neighbourhood of tree-child networks
- Heading in the right direction? Using head moves to traverse phylogenetic network space
- Rearrangement operations on unrooted phylogenetic networks
- Comparison of labeled trees with valency three
- Subtree transfer operations and their induced metrics on evolutionary trees
- On the complexity of comparing evolutionary trees
This page was built for publication: Exploring spaces of semi-directed level-1 networks
